Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
From MaRDI portal
Publication:4500853
Recommendations
Cited in
(30)- \(O(m\log n)\) split decomposition of strongly-connected graphs
- Detecting 2-joins faster
- Polynomial-time recognition of clique-width 3 graphs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- The bi-join decomposition
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- \(O(m \log n)\) split decomposition of strongly connected graphs
- Quick separation in chordal and split graphs
- A note on computing set overlap classes
- Linear-time modular decomposition of directed graphs
- Word-representability of graphs with respect to split recomposition
- Solving some NP-complete problems using split decomposition
- Practical and efficient split decomposition via graph-labelled trees
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)
- Practical and efficient circle graph recognition
- Algorithmic aspects of a general modular decomposition theory
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- Consecutive ones property testing: cut or swap
- A polynomial kernel for distance-hereditary vertex deletion
- On polygon numbers of circle graphs and distance hereditary graphs
- Vertex-minors of graphs: a survey
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
- Circle graph isomorphism in almost linear time
- Phylogenetic graph models beyond trees
- Some results on more flexible versions of Graph Motif
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
This page was built for publication: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500853)
