Pages that link to "Item:Q4500853"

The following pages link to Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition (Q4500853):

Displaying 25 items.

• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
• Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
• Practical and efficient circle graph recognition (Q472484) (← links)
• Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
• Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
• Solving some NP-complete problems using split decomposition (Q948695) (← links)
• \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
• A note on computing set overlap classes (Q975443) (← links)
• Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
• Phylogenetic graph models beyond trees (Q1026198) (← links)
• Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
• Linear-time modular decomposition of directed graphs (Q1764805) (← links)
• Some results on more flexible versions of Graph Motif (Q2354588) (← links)
• Detecting 2-joins faster (Q2376790) (← links)
• Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
• An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
• On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
• A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
• Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (Q3010409) (← links)
• Consecutive Ones Property Testing: Cut or Swap (Q3091461) (← links)
• The bi-join decomposition (Q3439330) (← links)
• Quick separation in chordal and split graphs (Q5089243) (← links)
• A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
• Vertex-minors of graphs: a survey (Q6495258) (← links)