Partition refinement techniques: an interesting algorithmic tool kit
From MaRDI portal
(Redirected from Publication:5248997)
Recommendations
- Three Partition Refinement Algorithms
- From generic partition refinement to weighted tree automata minimization
- An set refinement algorithm with applications
- Sorting and doubling techniques for set partitioning and automata minimization problems
- A survey of the algorithmic aspects of modular decomposition
Cites work
- A linear algorithm to decompose inheritance graphs into modules
- A Linear Recognition Algorithm for Cographs
- Algorithmic Aspects of Vertex Elimination on Graphs
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Doubly lexical ordering of dense 0--1 matrices
- Efficiency of a Good But Not Linear Set Union Algorithm
- Graphs indecomposable with respect to the X-join
- On a property of the class of n-colorable graphs
- Partially Ordered Sets
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Three Partition Refinement Algorithms
Cited in
(29)- Minimal interval completion through graph exploration
- Algorithmic aspects of a general modular decomposition theory
- Equimatchable claw-free graphs
- An efficient exact algorithm for triangle listing in large graphs
- A simple linear time algorithm for cograph recognition
- Partition refinement of component interaction automata
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- Characteristic invariants in Hennessy-Milner logic
- Parameterized complexity of a coupled-task scheduling problem
- Applying clique-decomposition for computing Gromov hyperbolicity
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
- Twins in Subdivision Drawings of Hypergraphs
- Three Partition Refinement Algorithms
- An set refinement algorithm with applications
- Polynomial-time recognition of clique-width 3 graphs
- A survey of the algorithmic aspects of modular decomposition
- Computing \(H\)-joins with application to 2-modular decomposition
- Cograph editing: Merging modules is equivalent to editing P₄s
- A Representation Theorem for Union-Difference Families and Application
- An algorithmic view of gene teams
- Partitioned difference families: the storm has not yet passed
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
- The role of twins in computing planar supports of hypergraphs
- Boolean-width of graphs
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- Minimal proper interval completions
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
This page was built for publication: Partition refinement techniques: an interesting algorithmic tool kit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248997)
