Influence of the tie-break rule on the end-vertex problem

End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976. Therefore it is interesting to consider if these vertices can be r...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Mathematics and Theoretical Computer Science Ročník 16 no. 2; číslo PRIMA 2013; s. 57 - 72
Hlavní autori: Charbit, Pierre, Habib, Michel, Mamcarz, Antoine
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Nancy DMTCS 29.07.2014
Discrete Mathematics & Theoretical Computer Science
Predmet:
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
[math.math-co] mathematics [math]/combinatorics [math.co]
Algorithms
Combinatorics
Computer Science
Data Structures and Algorithms
Discrete Mathematics
Graph theory
Mathematical research
Mathematics
ISSN:1365-8050, 1462-7264, 1365-8050
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976. Therefore it is interesting to consider if these vertices can be recognized in polynomial time or not, as first studied in Corneil, Köhler and Lanlignel 2010. A graph search is a mechanism for systematically visiting the vertices of a graph. At each step of a graph search, the key point is the choice of the next vertex to be explored. Graph searches only differ by this selection mechanism during which a tie-break rule is used. In this paper we study how the choice of the tie-break in case of equality during the search, for a given graph search including the classic ones such as BFS and DFS, can determine the complexity of the end-vertex problem. In particular we prove a counterintuitive NP-completeness result for Breadth First Search solving a problem raised in Corneil, Köhler and Lanlignel 2010.
AbstractList End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976. Therefore it is interesting to consider if these vertices can be recognized in polynomial time or not, as first studied in Corneil, Kohler and Lanlignel 2010. A graph search is a mechanism for systematically visiting the vertices of a graph. At each step of a graph search, the key point is the choice of the next vertex to be explored. Graph searches only differ by this selection mechanism during which a tie-break rule is used. In this paper we study how the choice of the tie-break in case of equality during the search, for a given graph search including the classic ones such as BFS and DFS, can determine the complexity of the end-vertex problem. In particular we prove a counterintuitive NP-completeness result for Breadth First Search solving a problem raised in Corneil, Kohler and Lanlignel 2010.
End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976. Therefore it is interesting to consider if these vertices can be recognized in polynomial time or not, as first studied in Corneil, Köhler and Lanlignel 2010. A graph search is a mechanism for systematically visiting the vertices of a graph. At each step of a graph search, the key point is the choice of the next vertex to be explored. Graph searches only differ by this selection mechanism during which a tie-break rule is used. In this paper we study how the choice of the tie-break in case of equality during the search, for a given graph search including the classic ones such as BFS and DFS, can determine the complexity of the end-vertex problem. In particular we prove a counterintuitive NP-completeness result for Breadth First Search solving a problem raised in Corneil, Köhler and Lanlignel 2010.
End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976. Therefore it is interesting to consider if these vertices can be recognized in polynomial time or not, as first studied in Corneil, Kohler and Lanlignel 2010. A graph search is a mechanism for systematically visiting the vertices of a graph. At each step of a graph search, the key point is the choice of the next vertex to be explored. Graph searches only differ by this selection mechanism during which a tie-break rule is used. In this paper we study how the choice of the tie-break in case of equality during the search, for a given graph search including the classic ones such as BFS and DFS, can determine the complexity of the end-vertex problem. In particular we prove a counterintuitive NP-completeness result for Breadth First Search solving a problem raised in Corneil, Kohler and Lanlignel 2010. Keywords: Graph algorithms, Graphs searches, end-vertex problem, BFS, DFS, LBFS, LDFS
Audience Academic
Author Habib, Michel
Charbit, Pierre
Mamcarz, Antoine
Author_xml – sequence: 1
  givenname: Pierre
  orcidid: 0000-0001-9401-040X
  surname: Charbit
  fullname: Charbit, Pierre
  organization: Networks, Graphs and Algorithms
– sequence: 2
  givenname: Michel
  orcidid: 0000-0002-8564-2314
  surname: Habib
  fullname: Habib, Michel
  organization: Networks, Graphs and Algorithms
– sequence: 3
  givenname: Antoine
  surname: Mamcarz
  fullname: Mamcarz, Antoine
  organization: Networks, Graphs and Algorithms
BackLink https://inria.hal.science/hal-01101514$$DView record in HAL
BookMark eNptkV9rHCEUxaUk0Px76hcY6FMps1VHHX1cQtssLPSleRbnzjVxO6Op44b229fstrQpwQfl8DuHez3n5CSmiIS8YXQlFDf6wzgXWFacavaKnLFOyVZTSU_-eb8m58uyo5RxI_ozYjbRT3uMgE3yTbnHpgRsh4zuW5P3U1XjQcU4to-YC_5oHnIaJpwvyal304JXv-8Lcvvp49frm3b75fPmer1tQShZWtC8R6m0Qak5KOgEaGMAvIa-51TQoXNI6UC9x54JrrWTYuBScTcID313QTbH3DG5nX3IYXb5p00u2IOQ8p11uQSY0KLqDNMDFVLVDAeOa9Zz4fmo648Ar1nvjln3bnoWdbPe2ieNMkaZZOKRVfbtka37ft_jUuwu7XOsq1qmme6Epor_pe5cHSBEn0p2MIcF7LrTghptlKzU6gWqnhHnALVDH6r-zMCOBshpWTJ6C6G4ElKsxjBZRu2hcHso3D4VXj3v__P82fAl-hdETKpE
CitedBy_id crossref_primary_10_1145_3711844
crossref_primary_10_1007_s00453_022_00981_5
ContentType Journal Article
Copyright COPYRIGHT 2014 DMTCS
Copyright DMTCS 2014
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: COPYRIGHT 2014 DMTCS
– notice: Copyright DMTCS 2014
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BFMQW
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
1XC
VOOES
DOA
DOI 10.46298/dmtcs.2081
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central (New) (NC LIVE)
Continental Europe Database
Technology collection
ProQuest One Community College
ProQuest Central
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering collection
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
Continental Europe Database
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList


CrossRef

Publicly Available Content Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1365-8050
EndPage 72
ExternalDocumentID oai_doaj_org_article_e63918b045654baca281724f2d8081c2
oai:HAL:hal-01101514v1
4178464411
A384098965
10_46298_dmtcs_2081
Genre Feature
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
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
REM
RNS
RSU
TR2
TUS
XSB
~8M
M~E
ADOJU
AZQEC
DWQXO
PKEHL
PQEST
PQUKI
PRINS
1XC
VOOES
ID FETCH-LOGICAL-c465t-c827e5689e582c6c34c899ccf8c772040b3ae00b0ffe714288a54b2562ab4fc73
IEDL.DBID DOA
ISICitedReferencesCount 13
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000342624300005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1365-8050
1462-7264
IngestDate Fri Oct 03 12:31:37 EDT 2025
Sat Nov 29 15:04:41 EST 2025
Fri Jul 25 12:25:07 EDT 2025
Wed Mar 19 01:46:05 EDT 2025
Sat Mar 08 18:02:10 EST 2025
Tue Nov 18 22:40:05 EST 2025
Sat Nov 29 02:48:22 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue PRIMA 2013
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c465t-c827e5689e582c6c34c899ccf8c772040b3ae00b0ffe714288a54b2562ab4fc73
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ORCID 0000-0001-9401-040X
0000-0002-8564-2314
OpenAccessLink https://doaj.org/article/e63918b045654baca281724f2d8081c2
PQID 1818348062
PQPubID 946337
PageCount 16
ParticipantIDs doaj_primary_oai_doaj_org_article_e63918b045654baca281724f2d8081c2
hal_primary_oai_HAL_hal_01101514v1
proquest_journals_1818348062
gale_infotracmisc_A384098965
gale_infotracacademiconefile_A384098965
crossref_citationtrail_10_46298_dmtcs_2081
crossref_primary_10_46298_dmtcs_2081
PublicationCentury 2000
PublicationDate 2014-07-29
PublicationDateYYYYMMDD 2014-07-29
PublicationDate_xml – month: 07
  year: 2014
  text: 2014-07-29
  day: 29
PublicationDecade 2010
PublicationPlace Nancy
PublicationPlace_xml – name: Nancy
PublicationTitle Discrete Mathematics and Theoretical Computer Science
PublicationYear 2014
Publisher DMTCS
Discrete Mathematics & Theoretical Computer Science
Publisher_xml – name: DMTCS
– name: Discrete Mathematics & Theoretical Computer Science
SSID ssj0012947
ssib044734695
Score 2.0134652
Snippet End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search...
SourceID doaj
hal
proquest
gale
crossref
SourceType Open Website
Open Access Repository
Aggregation Database
Enrichment Source
Index Database
StartPage 57
SubjectTerms [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
[math.math-co] mathematics [math]/combinatorics [math.co]
Algorithms
Combinatorics
Computer Science
Data Structures and Algorithms
Discrete Mathematics
Graph theory
Mathematical research
Mathematics
SummonAdditionalLinks – databaseName: Engineering Database
  dbid: M7S
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3daxQxEA-2-mAfrFbF01MWKQhC6F42u5s8ySmWCrUIftC3kEwSLda99m5b_POdyWVXTsQXX5N5mOx8ZCab_H6M7XtdxwqzHg-1FRyzX-TKuYpjL-JV1fjGJrimL8ftyYk6PdUf8oHbKl-rHHJiStR-AXRGfoA7kaqkKhvx6uKSE2sU_V3NFBpb7CahJIh0de_j-BdBaNmu3-TJRmh14H_0QBDdaraxCyWw_jElb32jG5F_JOa02xzu_q-ed9mdXGcW87Vj3GM3QrfHdgcOhyKH9B7beT_itq7uM_1u4CwpFrHAiaI_Cxy7Zvu9WF6d42iXRkPnORE5h59FZqR5wD4fvv305ohncgUOsql7Dkq0oW6UDrUS0EAlAVsvgKigJeKa0lU2lKUrYwwtwbIpW0uHBZKwTkZoq4dsu1t04RErtI5Rg9NE9inrNuiZ8FZChFiJmQ_1hL0cPraBjDxOBBjnBjuQZBmTLGPIMhO2PwpfrAE3_i72mqw2ihBKdhpYLL-aHHQmYPk1Uy5VrdJZsEJhvSaj8MQ3AmLCXpDNDcUyKgQ2P0nAZREqlplX1P4q3eASphuSGIOwMf0cvWZDmaP5saExqq-wqpLXqPJ08BiTE8XK_HaXx_-efsJuY60m6VhZ6Cnb7pdX4Sm7Bdf92Wr5LPn9L-g8Cko
  priority: 102
  providerName: ProQuest
Title Influence of the tie-break rule on the end-vertex problem
URI https://www.proquest.com/docview/1818348062
https://inria.hal.science/hal-01101514
https://doaj.org/article/e63918b045654baca281724f2d8081c2
Volume 16 no. 2
WOSCitedRecordID wos000342624300005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
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: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044734695
  issn: 1365-8050
  databaseCode: M~E
  dateStart: 19980101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– 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) (NC LIVE)
  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/eLvHCXMwrV1Lb9QwELagcIADjwJiYVlFqBISktWs7ST2cYu2aqV2teKlcrKcia1WlBTtphUnfjszjrNiERIXLjnYcxjPxPNI7O9jbK8xRZAY9bgvnOAY_QLXdS059iKNlmVTugjX9PmkWiz02ZlZ_kb1RWfCenjg3nD7HlPoVNex8lC1Ayc05lwVREOcERCjL1Y9QzOV_h8Io6r-Np4qhdH7zbcOCJxbT7fyT4Tp3wTj2-d0FvKPkBzzzOEj9iAViNmsV-wxu-XbXfZwIF_I0l7cZfdPN4Cr6yfMHA9kI9lVyHAi6y48x3bXfc1W15c42sZR3zacGJj9jyxRyTxlnw7nH98d8cSKwEGVRcdBi8oXpTa-0AJKkAqwZwIIGipinMlr6Xye13kIviI8Ne3QcFjZCFerAJV8xnbaq9Y_Z5kxIRioDbF0qqLyZioapyBAkGLa-GLE3g62spAgw4m54tJi6xANa6NhLRl2xPY2wt97pIy_ix2Q0TciBG8dB9DpNjnd_svpI_aGXGZpE6JC4NJdAlwWwVnZmaS-VZsSlzDeksTNA1vTr9HpW8oczU4sjVFhhOWQukGVx8M7YdMOX1usjLRUOi_Fi_-xopfsHpZiir4aCzNmO93q2r9id-Gmu1ivJuzOwXyxfD-JL_mEzqd-oOfPOc4sj0-XX34BEbMAjg
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Bb9MwFH7aOiTgwGCAKBSI0AAJKVrqOIl94NABVau1FUgDdjOxY8PESEebDfhT_EbeS52gIsRtB662FdnJl-99L7HfB7BbyMTFyHqhTXIWIvu5UGgdh5iLFCJOizSvyzW9m2SzmTg6kq834GdzFoa2VTacWBN1MTf0jXwPI5GIuYhS5ndQHtgf3zA_Wz4fv8SH-Zix4avDF6PQWwiEhqdJFRrBMpukQtpEMJOamBtMMIxxwmRkzxLpOLdRpCPnbEbFx0SecI0ygOWaO5PFeN0np19Dcqmiv7nesmMTtkQqY96Brf3h9M379r8FkzxbnQLkKZNir_hSGSoKLvprca-2B2iDwOYn2oP5Ryio49tw-3-7M9fhmlfSwWAF_RuwYcsd2G5cKgJPWjtwddpWpl3eBDluXFmCuQuwI6iObahROn8OFmcn2FrWrbYsQrKqtt8D77lzC95eyApvQ6ecl_YOBFI6J42WZGfKk8zKPitybpxxMesXNunCs-bhKuNrq5PFx4nCHKtGgqqRoAgJXdhtB5-uSor8fdg-oaQdQnXA64b54qPytKIsCsy-0LUu5zo3OROoSLljBTmqGNaFp4QxRWyFEzK5P3SBy6K6X2oQU4IvZIpL6K2NRJYxa92PEKVrkxkNJoraSEGibuTnOOVeg1DlqXCpfsPz7r-7H8Ll0eF0oibj2cE9uILKlNNHdCZ70KkWZ_Y-XDLn1fFy8cC_dQF8uGiE_wLd02fm
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=Influence+of+the+tie-break+rule+on+the+end-vertex+problem&rft.jtitle=Discrete+Mathematics+and+Theoretical+Computer+Science&rft.au=Charbit%2C+Pierre&rft.au=Habib%2C+Michel&rft.au=Mamcarz%2C+Antoine&rft.date=2014-07-29&rft.pub=DMTCS&rft.issn=1462-7264&rft.volume=16&rft.issue=2&rft.spage=57&rft_id=info:doi/10.46298%2Fdmtcs.2081&rft.externalDocID=A384098965
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