linear time algorithms / linear-time modular decomposition algorithm / decomposition algorithms / present algorithm / implementable linear time algorithm / linear time algorithm / polynomial time algorithm / linear-time algorithms / bad chain / polynomial-time algorithm / linear-time algorithm / linear time modular decomposition algorithm / linear time planarity testing algorithms / decomposition algorithm / graphs recognition algorithms / /
Organization
C. Paul Center / Society for Industrial and Applied Mathematics / /
Person
C. Capelle / F. de Montgolfier / M. Habib / Michel Habib / C. Paul Any / C. Paul Parts / Christophe Paul / /
Position
representative / head / /
Technology
present algorithm / linear-time algorithms / polynomial time algorithm / linear time algorithms / easily implementable linear time algorithm / polynomial-time algorithm / graph planarity using PQ-tree algorithm / decomposition algorithms / linear time algorithm / linear-time algorithm / decomposition algorithm / graphs recognition algorithms / 5 Linear-time implementation The algorithm / linear time planarity testing algorithms / /
A simple linear-time modular decomposition algorithm for graphs, using order extension? Michel Habib, Fabien de Montgolfier, and Christophe Paul