2000 character limit reached
Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
Published 15 Dec 2020 in cs.DS | (2012.08476v6)
Abstract: A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition algorithms differ widely. We further unify these two graph classes by presenting the first recognition algorithm for both path graphs and directed path graphs. We deeply use a recent characterization of path graphs, and we extend it to directed path graphs. Our algorithm does not require complex data structures and has an easy and intuitive implementation, simplifying recognition algorithms for both graph classes.
- Two new characterizations of path graphs. Discrete Mathematics 346, 12 (2023), 113596.
- Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms. Journal of Computer and System Sciences 13, 3 (1976), 335–379.
- Chaplick, S. PQR-Trees and Undirected Path Graphs. Citeseer, 2008.
- From Path Graphs to Directed Path Graphs. In Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010 (2010), vol. 6410 of Lecture Notes in Computer Science, pp. 256–265.
- The Ultimate Interval Graph Recognition Algorithm? In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (1998), ACM/SIAM, pp. 175–180.
- Recognition of Path Graphs in Linear Time. In 5th Italian Conference on Theoretical Computer Science (Revello, 1995) (1996), World Scientific, pp. 201–210.
- Dietz, P. F. Intersection Graph Algorithms. Tech. rep., Cornell University, 1984.
- Gavril, F. The Intersection Graphs of Subtrees in Trees are Exactly the Chordal Graphs. Journal of Combinatorial Theory, Series B 16, 1 (1974), 47–56.
- Gavril, F. A Recognition Algorithm for the Intersection Graphs of Directed Paths in Directed Trees. Discrete Mathematics 13, 3 (1975), 237–249.
- Gavril, F. A Recognition Algorithm for the Intersection Graphs of Paths in Trees. Discrete Mathematics 23, 3 (1978), 211–227.
- Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoretical Computer Science 234, 1-2 (2000), 59–84.
- Hsu, W. A Simple Test for Interval Graphs. In Graph-Theoretic Concepts in Computer Science, 18th International Workshop, Proceedings (1992), vol. 657 of Lecture Notes in Computer Science, Springer, pp. 11–16.
- PC trees and circular-ones arrangements. Theoretical Computer Science 296, 1 (2003), 99–116.
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs. SIAM Journal on Computing 18, 1 (1989), 68–81.
- Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae 51, 1 (1962), 45–64.
- Characterizing Path Graphs by Forbidden Induced Subgraphs. Journal of Graph Theory 62, 4 (2009), 369–384.
- Modular decomposition and transitive orientation. Discrete Mathematics 201, 1-3 (1999), 189–241.
- Intersection Graphs of Paths in a Tree. Journal of Combinatorial Theory, Series B 41, 2 (1986), 141–181.
- Novick, M. B. Parallel Algorithms for Intersection Graphs. Tech. rep., Cornell University, 1990.
- Renz, P. Intersection Representations of Graphs by Arcs. Pacific Journal of Mathematics 34, 2 (1970), 501–510.
- Algorithmic Aspects of Vertex Elimination on Graphs. SIAM Journal on Computing 5, 2 (1976), 266–283.
- Schäffer, A. A Faster Algorithm to Recognize Undirected Path Graphs. Discrete Appl. Math. 43, 3 (1993), 261–295.
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM Journal on computing 13, 3 (1984), 566–579.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.