Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
From MaRDI portal
Publication:4500853
DOI10.1006/jagm.2000.1090zbMath0961.68152OpenAlexW2103191280MaRDI QIDQ4500853
Publication date: 27 August 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0286cc8442b7bb554bf8f8258544d53029a98703
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (28)
Detecting 2-joins faster ⋮ Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree ⋮ Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions ⋮ A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion ⋮ An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion ⋮ On polygon numbers of circle graphs and distance hereditary graphs ⋮ A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs ⋮ Circle graph isomorphism in almost linear time ⋮ Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs ⋮ Polynomial-time recognition of clique-width \(\leq 3\) graphs ⋮ Practical and efficient circle graph recognition ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ Dynamic Distance Hereditary Graphs Using Split Decomposition ⋮ Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way ⋮ Solving some NP-complete problems using split decomposition ⋮ Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm ⋮ Linear-time modular decomposition of directed graphs ⋮ \(O(m\log n)\) split decomposition of strongly-connected graphs ⋮ A note on computing set overlap classes ⋮ A structure theorem for graphs with no cycle with a unique chord and its consequences ⋮ A polynomial kernel for distance-hereditary vertex deletion ⋮ Consecutive Ones Property Testing: Cut or Swap ⋮ Quick separation in chordal and split graphs ⋮ Algorithmic aspects of a general modular decomposition theory ⋮ Phylogenetic graph models beyond trees ⋮ O(m logn) Split Decomposition of Strongly Connected Graphs ⋮ The bi-join decomposition ⋮ Some results on more flexible versions of Graph Motif
This page was built for publication: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
