Shrub-depth: Capturing Height of Dense Graphs

The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question: is there an analogously useful "depth" notion also for dense graphs (say; one which is stable under graph complementation)? To this...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Logical methods in computer science Ročník 15, Issue 1; číslo 1
Hlavní autori: Ganian, Robert, Hliněný, Petr, Nešetřil, Jaroslav, Obdržálek, Jan, de Mendez, Patrice Ossona
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Logical Methods in Computer Science Association 01.01.2019
Logical Methods in Computer Science e.V
Predmet:
03b70, 05c75, 68r10
Combinatorics
computer science - discrete mathematics
computer science - logic in computer science
Mathematics
mathematics - combinatorics
ISSN:1860-5974, 1860-5974
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question: is there an analogously useful "depth" notion also for dense graphs (say; one which is stable under graph complementation)? To this end, in a 2012 conference paper, a new notion of shrub-depth has been introduced, such that it is related to the established notion of clique-width in a similar way as tree-depth is related to tree-width. Since then shrub-depth has been successfully used in several research papers. Here we provide an in-depth review of the definition and basic properties of shrub-depth, and we focus on its logical aspects which turned out to be most useful. In particular, we use shrub-depth to give a characterization of the lower ${\omega}$ levels of the MSO1 transduction hierarchy of simple graphs.
AbstractList The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question: is there an analogously useful "depth" notion also for dense graphs (say; one which is stable under graph complementation)? To this end, in a 2012 conference paper, a new notion of shrub-depth has been introduced, such that it is related to the established notion of clique-width in a similar way as tree-depth is related to tree-width. Since then shrub-depth has been successfully used in several research papers. Here we provide an in-depth review of the definition and basic properties of shrub-depth, and we focus on its logical aspects which turned out to be most useful. In particular, we use shrub-depth to give a characterization of the lower ${\omega}$ levels of the MSO1 transduction hierarchy of simple graphs.
Author Ganian, Robert
Nešetřil, Jaroslav
Obdržálek, Jan
Hliněný, Petr
de Mendez, Patrice Ossona
Author_xml – sequence: 1
  givenname: Robert
  surname: Ganian
  fullname: Ganian, Robert
– sequence: 2
  givenname: Petr
  orcidid: 0000-0003-2125-1514
  surname: Hliněný
  fullname: Hliněný, Petr
– sequence: 3
  givenname: Jaroslav
  surname: Nešetřil
  fullname: Nešetřil, Jaroslav
– sequence: 4
  givenname: Jan
  surname: Obdržálek
  fullname: Obdržálek, Jan
– sequence: 5
  givenname: Patrice Ossona
  orcidid: 0000-0003-0724-3729
  surname: de Mendez
  fullname: de Mendez, Patrice Ossona
BackLink https://hal.science/hal-02437683$$DView record in HAL
BookMark eNpVkM1OwzAQhC1UJErpA3DLkR4Cttexnd6qAm2lIA6Fs-X4p0lVkshJkXh7khYh2MuMVrOfVnONRlVdOYRuCb6nwEE-ZC_LbUySOzIXM4pJeoHGRHIcJ6lgoz_-Ck3bdo_7ASCS8jGKt0U45rF1TVfMo6VuumMoq120duWu6KLaR4-ual20Crop2ht06fWhddMfnaD356e35TrOXleb5SKLDTDcxZBwk4M0VHsDgjPojc-5914yQ9JUQyKk7UcwRqgnJmdCWClyaq3kxsEEbc5cW-u9akL5ocOXqnWpTos67JQOXWkOTqU0B-AGpz2QDWrBS-mNEERYIKJnzc6sQh_-odaLTA07TFn_pIRP0mfJOWtC3bbB-d8DgtWpajVUrUiiiBJqqBq-AeuEcOs
ContentType Journal Article
Copyright Attribution
Copyright_xml – notice: Attribution
DBID AAYXX
CITATION
1XC
DOA
DOI 10.23638/LMCS-15(1:7)2019
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
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 Computer Science
Mathematics
EISSN 1860-5974
ExternalDocumentID oai_doaj_org_article_92b336c098dd46c09d3f88fc7717d317
oai:HAL:hal-02437683v1
10_23638_LMCS_15_1_7_2019
GroupedDBID .4S
.DC
29L
2WC
5GY
5VS
AAFWJ
AAYXX
ADBBV
ADMLS
ADQAK
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
EBS
EJD
FRP
GROUPED_DOAJ
J9A
KQ8
MK~
ML~
M~E
OK1
OVT
P2P
TR2
TUS
XSB
1XC
ID FETCH-LOGICAL-c340t-356cb38c2afc376432affb6fff84c199a3578dddd74412f1cb477d87b2dd86ce3
IEDL.DBID DOA
ISICitedReferencesCount 41
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000463358400010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1860-5974
IngestDate Fri Oct 03 12:51:19 EDT 2025
Tue Oct 14 20:04:28 EDT 2025
Sat Nov 29 08:05:09 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License https://creativecommons.org/licenses/by/4.0
Attribution: http://creativecommons.org/licenses/by
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c340t-356cb38c2afc376432affb6fff84c199a3578dddd74412f1cb477d87b2dd86ce3
ORCID 0000-0003-0724-3729
0000-0003-2125-1514
OpenAccessLink https://doaj.org/article/92b336c098dd46c09d3f88fc7717d317
ParticipantIDs doaj_primary_oai_doaj_org_article_92b336c098dd46c09d3f88fc7717d317
hal_primary_oai_HAL_hal_02437683v1
crossref_primary_10_23638_LMCS_15_1_7_2019
PublicationCentury 2000
PublicationDate 2019-01-01
PublicationDateYYYYMMDD 2019-01-01
PublicationDate_xml – month: 01
  year: 2019
  text: 2019-01-01
  day: 01
PublicationDecade 2010
PublicationTitle Logical methods in computer science
PublicationYear 2019
Publisher Logical Methods in Computer Science Association
Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science Association
– name: Logical Methods in Computer Science e.V
SSID ssj0000331826
Score 2.4544618
Snippet The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question:...
SourceID doaj
hal
crossref
SourceType Open Website
Open Access Repository
Index Database
SubjectTerms 03b70, 05c75, 68r10
Combinatorics
computer science - discrete mathematics
computer science - logic in computer science
Mathematics
mathematics - combinatorics
Title Shrub-depth: Capturing Height of Dense Graphs
URI https://hal.science/hal-02437683
https://doaj.org/article/92b336c098dd46c09d3f88fc7717d317
Volume 15, Issue 1
WOSCitedRecordID wos000463358400010&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: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: DOA
  dateStart: 20040101
  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: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: M~E
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NT8IwFG-M8eDFbyN-ZTEe1KSBtWVtuSGCHICYoAm3Zv0KXoDA4Ojf7msHBk9e3GFbmmXt3mvf77237fcQus8494DjDueWa8ysYWAHNcOeGEFz6722UdM9PhiI0Ui-bZX6Ct-ElfTApeCqkmhKM1OTwloWjpZ6IbzhEIdYAL9gfcHr2Qqmog2mNDjO5WtMQmGSVXv91hCn9Ye0wR9JZNbZAqLI1w_wMt6kUyO8dI7QwdovTJrleI7RjpucoMNNzYVkvQRPER6O50uNrZsV40bSymdF_M8w6cYUZzL1yQsEpi55DUTUizP00Wm_t7p4XfIAG8pqBab1zGgqDMm9gaXPKJx4nXnvBTOplHkgp7GwcXBjiE-NZpxbwTWxVmTG0XO0O5lO3AVKUkdyA-ZMCCkY8bm0PgOFaQOgLp2sVdDT5vnVrGS2UBARRGGpICyV1lWquArCqqDnIKGfCwMpdWwAVam1qtRfqqqgO5Dvr3t0mz0V2iIvYiboKr38j56u0H4YdZkquUa7xXzpbtCeWRWfi_ltnCqw73-1vwEMd8Gl
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=Shrub-depth%3A+Capturing+Height+of+Dense+Graphs&rft.jtitle=Logical+methods+in+computer+science&rft.au=Ossona+de+Mendez%2C+Patrice&rft.au=Ganian%2C+Robert&rft.au=Hlin%C4%9Bn%C3%BD%2C+Petr&rft.au=Ne%C5%A1et%C5%99il%2C+Jaroslav&rft.date=2019-01-01&rft.pub=Logical+Methods+in+Computer+Science+Association&rft.eissn=1860-5974&rft.volume=15&rft.issue=1&rft_id=info:doi/10.23638%2FLMCS-15%281%3A7%292019&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-02437683v1
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon