Back to Results
First PageMeta Content
Cograph / Neighbourhood / Tree / Disjoint-set data structure / Breadth-first search / Path decomposition / Tree decomposition / Graph theory / Graph operations / Modular decomposition


Simpler Linear-Time Modular Decomposition via Recursive Factorizing Permutations Marc Tedder1 , Derek Corneil1⋆ , Michel Habib2 , and Christophe Paul3⋆⋆ 1 Department of Computer Science, University of Toronto
Add to Reading List

Document Date: 2008-04-30 14:20:20


Open Document

File Size: 151,79 KB

Share Result on Facebook

Currency

pence / /

/

Event

Product Recall / Product Issues / /

Facility

University of McGill / University of Toronto / University of Paris / /

IndustryTerm

et al. fundamental tool / recursive algorithms / straightforward linear-time modular decomposition algorithm / linear-time modular decomposition algorithm / transitive orientation algorithms / linear-time algorithms / polynomial-time algorithm / linear-time algorithm / breadth-first-search / Subsequent algorithms / /

Organization

School of Computer Science / University of Paris / Department of Computer Science / LIAFA / French ANR / University of McGill / University of Toronto / /

Person

Capelle / Cournier / Derek Corneil / Michel Habib / Christophe Paul / Marc Tedder / Denis Diderot / /

Product

Assembly / /

Technology

Inspecting algorithm / promotion algorithm / bioinformatics / linear-time algorithms / Examining algorithms / polynomial-time algorithm / 7 Algorithm / previous recursive algorithms / linear-time algorithm / decomposition algorithm / 2.1 Recursion The algorithm / transitive orientation algorithms / /

SocialTag