PC trees and circular-ones arrangements.
From MaRDI portal
Publication:1401263
DOI10.1016/S0304-3975(02)00435-8zbMath1044.68125MaRDI QIDQ1401263
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
- Theory of 2-structures. II: Representation through labeled tree families
- An efficient parallel algorithm for planarity
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A new planarity test
- Incidence matrices and interval graphs
- A Simple Test for the Consecutive Ones Property
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Decomposition of Directed Graphs
- Transitiv orientierbare Graphen