The following pages link to (Q4506382):
Displaying 8 items.
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Some remarks on the geodetic number of a graph (Q965962) (← links)
- On the computation of the hull number of a graph (Q1045055) (← links)
- An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
- On the convexity number of graphs (Q1926045) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)