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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics and theoretical computer science Jg. 27:2; H. Discrete Algorithms
1. Verfasser: Balzotti, Lorenzo
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Discrete Mathematics & Theoretical Computer Science 01.05.2025
Schlagworte:
computer science - data structures and algorithms
f.2.2
g.2.2
ISSN:1365-8050, 1365-8050
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
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. Comment: 13 pages, 3 figures
AbstractList 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.
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
Author Balzotti, Lorenzo
Author_xml – sequence: 1
  givenname: Lorenzo
  surname: Balzotti
  fullname: Balzotti, Lorenzo
BookMark eNpNkN1OwkAQRjcGEwG98wH6AIL71233kqAiCYkG5Xoz3Z2FJW2XbHvj20uKMVzNZL58J5MzIaM2tkjII6Nzqbgun13T227OhMjzGzJmQuWzkuZ0dLXfkUnXHSllXMtiTLZfoTnVmDJoXbZrgw_osi3auG9DH2KbLep9TKE_NJmPKfuE_pCtEpwO3dB4CQltf65cBffk1kPd4cPfnJLd2-v38n22-Vitl4vNzHImzs9UwLniXpXcg5dOIi1LqSvPeSmk9Ewwz7hwRYGFE1paxIpBTpUFRSF3YkrWF66LcDSnFBpIPyZCMMMhpr2B1Adbo6kcVMCQeaqUpKh0zinVaGnhlHLanllPF5ZNsesS-n8eo2Zwawa3ZnArfgFgnm6x
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.46298/dmtcs.13355
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1365-8050
ExternalDocumentID oai_doaj_org_article_bdaba1e1f06640e6952009ec07d66d9c
10_46298_dmtcs_13355
GroupedDBID -~9
.4S
.DC
29G
2WC
5GY
5VS
8FE
8FG
AAFWJ
AAYXX
ABDBF
ABJCF
ABUWG
ACGFO
ACIWK
ACUHS
ADBBV
ADQAK
AENEX
AFFHD
AFKRA
AFPKN
AIAGR
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARCSS
B0M
BAIFH
BBTPI
BCNDV
BENPR
BFMQW
BGLVJ
BPHCQ
CCPQU
CITATION
EAP
EBS
ECS
EDO
EJD
EMK
EPL
EST
ESX
GROUPED_DOAJ
HCIFZ
I-F
IAO
IBB
ICD
ITC
J9A
KQ8
KWQ
L6V
M7S
MK~
ML~
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
PV9
REM
RNS
RSU
RZL
TR2
TUS
XSB
~8M
ID FETCH-LOGICAL-c2135-8ba2262f682faf4d4e08849bf228344f131f123d77e7d394ceeb1a506ca60a5d3
IEDL.DBID DOA
ISSN 1365-8050
IngestDate Fri Oct 03 12:44:35 EDT 2025
Sat Nov 29 07:59:07 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue Discrete Algorithms
Language English
License https://arxiv.org/licenses/nonexclusive-distrib/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2135-8ba2262f682faf4d4e08849bf228344f131f123d77e7d394ceeb1a506ca60a5d3
OpenAccessLink https://doaj.org/article/bdaba1e1f06640e6952009ec07d66d9c
ParticipantIDs doaj_primary_oai_doaj_org_article_bdaba1e1f06640e6952009ec07d66d9c
crossref_primary_10_46298_dmtcs_13355
PublicationCentury 2000
PublicationDate 2025-05-01
PublicationDateYYYYMMDD 2025-05-01
PublicationDate_xml – month: 05
  year: 2025
  text: 2025-05-01
  day: 01
PublicationDecade 2020
PublicationTitle Discrete mathematics and theoretical computer science
PublicationYear 2025
Publisher Discrete Mathematics & Theoretical Computer Science
Publisher_xml – name: Discrete Mathematics & Theoretical Computer Science
SSID ssj0012947
Score 2.3286357
Snippet 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...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - data structures and algorithms
f.2.2
g.2.2
Title Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
URI https://doaj.org/article/bdaba1e1f06640e6952009ec07d66d9c
Volume 27:2
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: DOA
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVPQU
  databaseName: Continental Europe Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BFMQW
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/conteurope
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: M7S
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central (New)
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: PIMPY
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQYYCBRwFRHpUHGEOdxLHjsSBeEq2i8lCZIj-hEk1RU_j92E5SdWNhyeDkoui7-O475fIdAOcKpzFnXAQSIxVgausUxt1BIJOEklPjp0S8PtLhMB2PWbYy6sv1hFXywBVwPaG44KEOjc2NGGnCvE6QlogqQhSTLvoiyppiqv5-EDFMqzZ3TCKW9tR0IctLW4-5X_pWEtCKTr9PKLe7YLtmgrBfPcEeWNNFG-w0UxZgvenaYGuwVFYt98HoaeL0fOeQFwpawmgshYSjpgtoVsD-5_vMFvwfU2jpKMysLbxzotSlt6ginDVZOXEAXm5vnq_vg3ouQiCjME6CVHBLmiJD0shwgxXWNlRgJoyTssHYhHFobEJSlGqqYoZtHhQhTxCRnCCeqPgQtIpZoY8ATFPCBDfUSKoxkYkQkY60lgnSWFhu1gEXDVj5VyV_kduywYOae1BzD2oHXDkkl9c40Wq_YF2Z167M_3Ll8X_c5ARsRm5Er-9JPAWtxfxbn4EN-bOYlPOuf0u6YD17GGRvv3CZxaI
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Simpler+and+Unified+Recognition+Algorithm+for+Path+Graphs+and+Directed+Path+Graphs&rft.jtitle=Discrete+mathematics+and+theoretical+computer+science&rft.au=Balzotti%2C+Lorenzo&rft.date=2025-05-01&rft.issn=1365-8050&rft.eissn=1365-8050&rft.volume=27%3A2&rft.issue=Discrete+Algorithms&rft_id=info:doi/10.46298%2Fdmtcs.13355&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_dmtcs_13355
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon