The following pages link to (Q4331190):
Displaying 9 items.
- Decomposition tree of a lexicographic product of binary structures (Q409340) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
