Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
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...
Uloženo v:
| Vydáno v: | Discrete mathematics and theoretical computer science Ročník 27:2; číslo Discrete Algorithms |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Discrete Mathematics & Theoretical Computer Science
01.05.2025
|
| Témata: | |
| ISSN: | 1365-8050, 1365-8050 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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.
Comment: 13 pages, 3 figures |
|---|---|
| ISSN: | 1365-8050 1365-8050 |
| DOI: | 10.46298/dmtcs.13355 |