Recommendations
Cites work
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 1478125 (Why is no real title available?)
- scientific article; zbMATH DE number 1798164 (Why is no real title available?)
- scientific article; zbMATH DE number 2119749 (Why is no real title available?)
- scientific article; zbMATH DE number 3315017 (Why is no real title available?)
- A Simple Test for the Consecutive Ones Property
- A new planarity test
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- An efficient parallel algorithm for planarity
- Decomposition of Directed Graphs
- Incidence matrices and interval graphs
- Introduction to algorithms
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
- Theory of 2-structures. II: Representation through labeled tree families
- Transitiv orientierbare Graphen
Cited in
(39)- Normal Helly circular-arc graphs and its subclasses
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property
- Tree-representation of set families and applications to combinatorial decompositions
- Planarity algorithms via PQ-trees (extended abstract)
- A faster algorithm for finding minimum Tucker submatrices
- \(O(m\log n)\) split decomposition of strongly-connected graphs
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
- A Representation Theorem for Union-Difference Families and Application
- Cyclic arrangements with minimum modulo \(m\) winding numbers
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
- Experimental comparison of PC-trees and PQ-trees
- Red-blue covering problems and the consecutive ones property
- Obtaining matrices with the consecutive ones property by row deletions
- Computing the clique-separator graph for an interval graph in linear time
- Counting the orderings for multisets in consecutive ones property and PQ-trees
- Heuristic methods to consecutive block minimization
- A Simple Test for the Consecutive Ones Property
- Bounded Embeddings of Graphs in the Plane
- A polynomial-time algorithm for finding a minimal conflicting set containing a given row
- Isomorphism of graph classes related to the circular-ones property
- A Simple and Optimal Algorithm for Strict Circular Seriation
- Affine and projective tree metric theorems
- Algorithmic aspects of switch cographs
- Clustered planarity with pipes
- Consecutive ones property testing: cut or swap
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
- A simpler linear-time recognition of circular-arc graphs
- Semi-proper interval graphs
- Group control for consent rules with consecutive qualifications
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Extending partial representations of circular-arc graphs
- A filter-based algorithm for efficient composition of finite-state transducers
- Filters for Efficient Composition of Weighted Finite-State Transducers
- Circular-arc hypergraphs: rigidity via connectedness
- Fully dynamic representations of interval graphs
- On semi-transitive orientability of split graphs
- Consecutive block minimization is 1.5-approximable
This page was built for publication: PC trees and circular-ones arrangements.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401263)
