Pages that link to "Item:Q4285914"
From MaRDI portal
The following pages link to An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs (Q4285914):
Displaying 21 items.
- Simple DFS on the complement of a graph and on partially complemented digraphs (Q318918) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Algorithmic aspects of switch cographs (Q906430) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← 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)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- On Modular Decomposition Concepts: the case for Homogeneous Relations (Q3439506) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- <font>NLC</font><sub>2</sub>-DECOMPOSITION IN POLYNOMIAL TIME (Q5249046) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
- Symmetric maximal Condorcet domains (Q6171422) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
- Modules in Robinson Spaces (Q6187080) (← links)
- Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs (Q6591462) (← links)
