Pages that link to "Item:Q1897475"

The following pages link to An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475):

Displaying 13 items.

• Approximating modular decomposition is hard (Q779173) (← links)
• Algorithmic aspects of switch cographs (Q906430) (← links)
• Dynamically maintaining split graphs (Q1026107) (← links)
• Modular decomposition and transitive orientation (Q1301738) (← links)
• Linear-time modular decomposition of directed graphs (Q1764805) (← links)
• A linear algorithm to decompose inheritance graphs into modules (Q1892582) (← links)
• The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations (Q2014353) (← links)
• From modular decomposition trees to rooted median graphs (Q2074346) (← links)
• From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
• Special data structures for problems on graphs associated with the notion of clique or with modular decomposition (Q2849145) (← links)
• An Algorithm for the Modular Decomposition of Hypergraphs (Q4264487) (← links)
• An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs (Q4285914) (← links)
• <font>NLC</font>₂-DECOMPOSITION IN POLYNOMIAL TIME (Q5249046) (← links)