Pages that link to "Item:Q2775895"

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

Displaying 31 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)
• On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
• Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
• The pair completion algorithm for the homogeneous set sandwich problem (Q844163) (← links)
• On transitive orientations with restricted covering graphs (Q845912) (← links)
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
• Matching cutsets in graphs of diameter 2 (Q955037) (← links)
• Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
• Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
• Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
• On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
• On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
• (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
• An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
• Single machine scheduling with precedence constraints and positionally dependent processing times (Q1762097) (← links)
• On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
• A simple linear time algorithm for cograph recognition (Q1764804) (← links)
• Linear-time modular decomposition of directed graphs (Q1764805) (← links)
• Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
• From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
• Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
• Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
• On the parallel computation of the biconnected and strongly connected co-components of graphs (Q2383544) (← links)
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
• Clique-perfectness and balancedness of some graph classes (Q2931952) (← 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)