Pages that link to "Item:Q5248997"

The following pages link to PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT (Q5248997):

Displaying 25 items.

• Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
• A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
• An algorithmic view of gene teams (Q596107) (← links)
• Boolean-width of graphs (Q719257) (← links)
• Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
• Minimal proper interval completions (Q963366) (← links)
• \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
• Minimal interval completion through graph exploration (Q1001896) (← links)
• Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
• Equimatchable claw-free graphs (Q1660273) (← links)
• An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
• A simple linear time algorithm for cograph recognition (Q1764804) (← links)
• Partition refinement of component interaction automata (Q1951613) (← links)
• From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
• Characteristic invariants in Hennessy-Milner logic (Q2182678) (← links)
• Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
• Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
• Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
• A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
• Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
• Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
• A Representation Theorem for Union-Difference Families and Application (Q5458554) (← links)
• Subquadratic-time algorithm for the diameter and all eccentricities on median graphs (Q6151151) (← links)
• \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)