From Path Graphs to Directed Path Graphs

Abstract : We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to find an odd sun when the method fails. This algorithm has several interesting consequences concerning the relationship between path graphs and directed path graphs. One is that for a directed path graph, path graph models and directed path graph models are the same. Another consequence concerns the difference between path graphs and directed path graphs in terms of forbidden induced subgraphs. This can be used to deduce the forbidden induced subgraph characterization of directed path graphs from the forbidden induced subgraph characterization of path graphs. The last consequence is algorithmic and shows that the recognition of directed path graphs is not more difficult than the recognition of path graphs.
Type de document :
Communication dans un congrès
WG'10: International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.256-265, 2010, LNCS. 〈http://wg2010.thilikos.info/〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00620726
Contributeur : Benjamin Lévêque <>
Soumis le : jeudi 8 septembre 2011 - 14:24:05
Dernière modification le : jeudi 24 mai 2018 - 15:59:22

Identifiants

  • HAL Id : lirmm-00620726, version 1

Collections

Citation

Steve Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia Tondato. From Path Graphs to Directed Path Graphs. WG'10: International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.256-265, 2010, LNCS. 〈http://wg2010.thilikos.info/〉. 〈lirmm-00620726〉

Partager

Métriques

Consultations de la notice

127