Flip-width: Cops and Robber on dense graphs
We define new graph parameters, called flip-width, that generalize treewidth, degeneracy, and generalized coloring numbers for sparse graphs, and clique-width and twin-width for dense graphs. The flip-width parameters are defined using variants of the Cops and Robber game, in which the robber has sp...
Uložené v:
| Vydané v: | Proceedings / annual Symposium on Foundations of Computer Science s. 663 - 700 |
|---|---|
| Hlavný autor: | |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
06.11.2023
|
| Predmet: | |
| ISSN: | 2575-8454 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We define new graph parameters, called flip-width, that generalize treewidth, degeneracy, and generalized coloring numbers for sparse graphs, and clique-width and twin-width for dense graphs. The flip-width parameters are defined using variants of the Cops and Robber game, in which the robber has speed bounded by a fixed constant r \in \mathbb{N} \cup\{\infty\}, and the cops perform flips (or perturbations) of the considered graph. We then propose a new notion of tameness of a graph class, called bounded flip-width, which is a dense counterpart of classes of bounded expansion of Nešetřil and Ossona de Mendez, and includes classes of bounded twin-width of Bonnet, Kim, Thomassé, and Watrigant. This unifies Sparsity Theory and Twin-width Theory, for the first time providing a common language for studying the central notions of the two theories, such as weak coloring numbers and twin-width - corresponding to winning strategies of one player - or dense shallow minors, rich divisions, or well-linked sets, corresponding to winning strategies of the other player. To demonstrate the robustness of the introduced notions, we prove that boundedness of flip-width is preserved by first-order interpretations, or transductions, generalizing previous results concerning classes of bounded expansion and bounded twin-width. We also show that the considered notions are amenable to algorithms, by providing an algorithm approximating the flip-width of a given graph, which runs in slice-wise polynomial time (XP) in the size of the graph. Finally, we propose a more general notion of tameness, called almost bounded flip-width, which is a dense counterpart of nowhere dense classes. We conjecture, and provide evidence, that classes with almost bounded flip-width coincide with monadically dependent (or monadically NIP) classes, introduced by Shelah in model theory. We also provide evidence that classes of almost bounded flip-width characterise the hereditary graph classes for which the model-checking problem is fixed-parameter tractable, which is of central importance in structural and algorithmic graph theory. |
|---|---|
| AbstractList | We define new graph parameters, called flip-width, that generalize treewidth, degeneracy, and generalized coloring numbers for sparse graphs, and clique-width and twin-width for dense graphs. The flip-width parameters are defined using variants of the Cops and Robber game, in which the robber has speed bounded by a fixed constant r \in \mathbb{N} \cup\{\infty\}, and the cops perform flips (or perturbations) of the considered graph. We then propose a new notion of tameness of a graph class, called bounded flip-width, which is a dense counterpart of classes of bounded expansion of Nešetřil and Ossona de Mendez, and includes classes of bounded twin-width of Bonnet, Kim, Thomassé, and Watrigant. This unifies Sparsity Theory and Twin-width Theory, for the first time providing a common language for studying the central notions of the two theories, such as weak coloring numbers and twin-width - corresponding to winning strategies of one player - or dense shallow minors, rich divisions, or well-linked sets, corresponding to winning strategies of the other player. To demonstrate the robustness of the introduced notions, we prove that boundedness of flip-width is preserved by first-order interpretations, or transductions, generalizing previous results concerning classes of bounded expansion and bounded twin-width. We also show that the considered notions are amenable to algorithms, by providing an algorithm approximating the flip-width of a given graph, which runs in slice-wise polynomial time (XP) in the size of the graph. Finally, we propose a more general notion of tameness, called almost bounded flip-width, which is a dense counterpart of nowhere dense classes. We conjecture, and provide evidence, that classes with almost bounded flip-width coincide with monadically dependent (or monadically NIP) classes, introduced by Shelah in model theory. We also provide evidence that classes of almost bounded flip-width characterise the hereditary graph classes for which the model-checking problem is fixed-parameter tractable, which is of central importance in structural and algorithmic graph theory. |
| Author | Torunczyk, Szymon |
| Author_xml | – sequence: 1 givenname: Szymon surname: Torunczyk fullname: Torunczyk, Szymon organization: University of Warsaw,Poland |
| BookMark | eNotjV1LwzAUQKMouM39gz3kXVrvTXJN4psUq8Jg4MfzSJcbV5ltaQbiv7cwn87L4Zy5uOj6joVYIZSI4G_rTfVG1nsoFShdAoChM7H01jtNoNF5Y87FTJGlwhkyV2Ke89dkAYGZiZv60A7FTxuP-3tZ9UOWoYvytW8aHmXfychdZvk5hmGfr8VlCofMy38uxEf9-F49F-vN00v1sC5aBeZYJMNaxeCSne4uJRc88S6gIucYVGjQRZU8Ihtl-Y6dSlHrnW3MZHgkvRCrU7dl5u0wtt9h_N0iaNJIqP8AIrhDKg |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/FOCS57990.2023.00045 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISBN | 9798350318944 |
| EISSN | 2575-8454 |
| EndPage | 700 |
| ExternalDocumentID | 10353151 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: European Research Council funderid: 10.13039/501100000781 |
| GroupedDBID | --Z 6IE 6IH 6IK ALMA_UNASSIGNED_HOLDINGS CBEJK RIE RIO |
| ID | FETCH-LOGICAL-i204t-f4e32da8f73188ff8a95eca12588e02ab18d2f911e427e6e82fd33c7b42589153 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 13 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001137125900039&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:25:35 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i204t-f4e32da8f73188ff8a95eca12588e02ab18d2f911e427e6e82fd33c7b42589153 |
| PageCount | 38 |
| ParticipantIDs | ieee_primary_10353151 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-Nov.-6 |
| PublicationDateYYYYMMDD | 2023-11-06 |
| PublicationDate_xml | – month: 11 year: 2023 text: 2023-Nov.-6 day: 06 |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings / annual Symposium on Foundations of Computer Science |
| PublicationTitleAbbrev | FOCS |
| PublicationYear | 2023 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0040504 |
| Score | 2.4321256 |
| Snippet | We define new graph parameters, called flip-width, that generalize treewidth, degeneracy, and generalized coloring numbers for sparse graphs, and clique-width... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 663 |
| SubjectTerms | Approximation algorithms Computational modeling Computer science first-order logic Games Graph theory model checking monadic dependence parameterised complexity Perturbation methods Robustness structural graph theory transductions |
| Title | Flip-width: Cops and Robber on dense graphs |
| URI | https://ieeexplore.ieee.org/document/10353151 |
| WOSCitedRecordID | wos001137125900039&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 | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagYoClUIooL3lgQymp48Q2a0XEQql4SN0qP84iEkqqJoW_j-2mRQwMbJYty9LZ9_l1330IXWcJEVTzNDKaugsKs_6TUEIUg6Cxj1JI0rXYBJtM-Gwmpi1ZPXBhACAEn8HQF8Nfvqn0yj-VOQ9P3JLxhOldxtiarLWBXXfwiGnLjRvF4jZ_Gr-kzGHt0AuEh6Sc6S8FlbCB5N1_Dn2I-j9UPDzdbjJHaAfKHuputBhw65o9dPC4zb9aH6Ob_KNYRF-Fad7v8Lha1FiWBj9XSrk-VYkd2NSAQ7Lquo_e8vvX8UPUyiJEBYlpE1kKCTGSW-b8kVvLpUhBS3dS4RxiItWIG2IdiAElDDLgxJok0Uw59-TCIdwJ6pRVCacICyOpIIpkwgrXKrg2qWSKQyaJ5soMUN-bYr5YZ76Yb6xw9kf9Odr31g5cvewCdZrlCi7Rnv5sinp5FebrG0TmlKo |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA4yBfUynRN_m4M36ezStE28DsvEbQ6dsNtIkxcsSDvWTv99k6ybePDgLSSEwEvel1_vex9CN1FAOJUs9JSk5oISa_tJKMDzgVPfRikE4UpsIh6N2HTKxzVZ3XFhAMAFn0HHFt1fvirk0j6VGQ8PzJKxhOntkFLSXdG11sBrjh4-rdlxXZ_fJc-91zA2aNuxEuEuLWf4S0PFbSFJ85-DH6D2DxkPjzfbzCHagryFmms1Blw7ZwvtDzcZWMsjdJt8ZHPvK1PV-z3uFfMSi1zhlyJNTZ8ixwZuSsAuXXXZRm_Jw6TX92phBC8jPq08TSEgSjAdG49kWjPBQ5DCnFUYA5-ItMsU0QbGgJIYImBEqyCQcWoclHGDcceokRc5nCDMlaCcpCTimptWzqQKRZwyiASRLFWnqG1NMZuvcl_M1lY4-6P-Gu32J8PBbPA4ejpHe9byjrkXXaBGtVjCJdqRn1VWLq7c3H0DNHKX8Q |
| 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%3Abook&rft.genre=proceeding&rft.title=Proceedings+%2F+annual+Symposium+on+Foundations+of+Computer+Science&rft.atitle=Flip-width%3A+Cops+and+Robber+on+dense+graphs&rft.au=Torunczyk%2C+Szymon&rft.date=2023-11-06&rft.pub=IEEE&rft.eissn=2575-8454&rft.spage=663&rft.epage=700&rft_id=info:doi/10.1109%2FFOCS57990.2023.00045&rft.externalDocID=10353151 |