From path graphs to directed path graphs

Autores
Chaplick, Steven; Gutiérrez, Marisa; Lévêque, Benjamin; Tondato, Silvia Beatriz
Año de publicación
2010
Idioma
español castellano
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
Trabajo publicado en Lecture Notes in Computer Science book series (LNCS, vol. 6410)
Facultad de Ciencias Exactas
Materia
Matemática
Combinatorics
Discrete mathematics
Longest path problem
Mathematics
Pathwidth
Induced path
Cograph
Indifference graph
Widest path problem
Hamiltonian path
Path (graph theory)
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/127414
Acceder
id SEDICI_515134edc675d92792c42c50efc7f9af
oai_identifier_str oai:sedici.unlp.edu.ar:10915/127414
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling From path graphs to directed path graphsChaplick, StevenGutiérrez, MarisaLévêque, BenjaminTondato, Silvia BeatrizMatemáticaCombinatoricsDiscrete mathematicsLongest path problemMathematicsPathwidthInduced pathCographIndifference graphWidest path problemHamiltonian pathPath (graph theory)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.Trabajo publicado en <i>Lecture Notes in Computer Science</i> book series (LNCS, vol. 6410)Facultad de Ciencias Exactas2010info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf256-265http://sedici.unlp.edu.ar/handle/10915/127414spainfo:eu-repo/semantics/altIdentifier/issn/0302-9743info:eu-repo/semantics/altIdentifier/issn/1611-3349info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-16926-7_24info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T11:02:44Zoai:sedici.unlp.edu.ar:10915/127414Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 11:02:44.908SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv From path graphs to directed path graphs
title From path graphs to directed path graphs
spellingShingle From path graphs to directed path graphs
Chaplick, Steven
Matemática
Combinatorics
Discrete mathematics
Longest path problem
Mathematics
Pathwidth
Induced path
Cograph
Indifference graph
Widest path problem
Hamiltonian path
Path (graph theory)
title_short From path graphs to directed path graphs
title_full From path graphs to directed path graphs
title_fullStr From path graphs to directed path graphs
title_full_unstemmed From path graphs to directed path graphs
title_sort From path graphs to directed path graphs
dc.creator.none.fl_str_mv Chaplick, Steven
Gutiérrez, Marisa
Lévêque, Benjamin
Tondato, Silvia Beatriz
author Chaplick, Steven
author_facet Chaplick, Steven
Gutiérrez, Marisa
Lévêque, Benjamin
Tondato, Silvia Beatriz
author_role author
author2 Gutiérrez, Marisa
Lévêque, Benjamin
Tondato, Silvia Beatriz
author2_role author
author
author
dc.subject.none.fl_str_mv Matemática
Combinatorics
Discrete mathematics
Longest path problem
Mathematics
Pathwidth
Induced path
Cograph
Indifference graph
Widest path problem
Hamiltonian path
Path (graph theory)
topic Matemática
Combinatorics
Discrete mathematics
Longest path problem
Mathematics
Pathwidth
Induced path
Cograph
Indifference graph
Widest path problem
Hamiltonian path
Path (graph theory)
dc.description.none.fl_txt_mv 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.
Trabajo publicado en <i>Lecture Notes in Computer Science</i> book series (LNCS, vol. 6410)
Facultad de Ciencias Exactas
description 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.
publishDate 2010
dc.date.none.fl_str_mv 2010
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/127414
url http://sedici.unlp.edu.ar/handle/10915/127414
dc.language.none.fl_str_mv spa
language spa
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/0302-9743
info:eu-repo/semantics/altIdentifier/issn/1611-3349
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-16926-7_24
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
256-265
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260525880180736
score 13.13397

Publicaciones similares