Pages that link to "Item:Q2775895"

The following pages link to Efficient and Practical Algorithms for Sequential Modular Decomposition (Q2775895):

Displaying 7 items.

• A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
• A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
• Graphs of linear clique-width at most 3 (Q719287) (← links)
• The possible cardinalities of global secure sets in cographs (Q764303) (← links)
• Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
• Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)