A fast parallel algorithm to recognize P4-sparse graphs
From MaRDI portal
Publication:1382265
DOI10.1016/S0166-218X(97)00085-1zbMath0894.68110WikidataQ127797600 ScholiaQ127797600MaRDI QIDQ1382265
Publication date: 19 August 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
schedulingcluster analysismobile computingnetworkingautomated theorem provinggroup-based collaboration
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Some new classes of open distance-pattern uniform graphs ⋮ Efficient parallel recognition of cographs
Cites Work
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
- Complement reducible graphs
- A tree representation for \(P_ 4\)-sparse graphs
- On a class of posets and the corresponding comparability graphs
- An optimal parallel matching algorithm for cographs
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Hamiltonicity in graphs with few \(P_ 4\)'s
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- On a property of the class of n-colorable graphs
- Parallel Algorithm for Cograph Recognition with Applications
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- A Linear Recognition Algorithm for Cographs
- The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
- Isomorphism Testing in Hookup Classes
- Recognizing $P_4 $-Sparse Graphs in Linear Time
- Dacey Graphs
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- P-Components and the Homogeneous Decomposition of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A fast parallel algorithm to recognize P4-sparse graphs
