DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bonnet, Edouard | ko |
dc.contributor.author | Kim, Eunjung | ko |
dc.contributor.author | Thomasse, Stephan | ko |
dc.contributor.author | Watrigant, Remi | ko |
dc.date.accessioned | 2024-02-05T07:00:15Z | - |
dc.date.available | 2024-02-05T07:00:15Z | - |
dc.date.created | 2024-02-05 | - |
dc.date.created | 2024-02-05 | - |
dc.date.issued | 2022-02 | - |
dc.identifier.citation | JOURNAL OF THE ACM, v.69, no.1 | - |
dc.identifier.issn | 0004-5411 | - |
dc.identifier.uri | http://hdl.handle.net/10203/318000 | - |
dc.description.abstract | Inspired by a width invariant defined on permutations by Guillemot and Marx [SODA'14], we introduce the notion of twin-width on graphs and on matrices. Proper minor-closed classes, bounded rank-width graphs, map graphs, K-t-free unit d-dimensional ball graphs, posets with antichains of bounded size, and proper subclasses of dimension-2 posets all have bounded twin-width. On all these classes (except map graphs without geometric embedding) we show how to compute in polynomial time a sequence of d-contractions, witness that the twin-width is at most d. We show that FO model checking, that is deciding if a given first-order formula phi evaluates to true for a given binary structure G on a domain D, is FPT in vertical bar phi vertical bar on classes of bounded twin-width, provided the witness is given. More precisely, being given a d-contraction sequence for G, our algorithm runs in time f (d,vertical bar phi vertical bar)center dot vertical bar D vertical bar where f is a computable but non-elementary function. We also prove that bounded twin-width is preserved under FO interpretations and transductions (allowing operations such as squaring or complementing a graph). This unifies and significaiitly extends the knowledge on fixed-parameter tractability of FO model checking on non-monotone classes, such as the FPT algorithm on bounded-width posets by Gajarsky et al. [FOCS'15]. | - |
dc.publisher | ASSOC COMPUTING MACHINERY | - |
dc.title | Twin-width I: Tractable FO Model Checking | - |
dc.type | Article | - |
dc.identifier.wosid | 000754960900006 | - |
dc.identifier.scopusid | 2-s2.0-85124907952 | - |
dc.type.rims | ART | - |
dc.citation.volume | 69 | - |
dc.citation.issue | 1 | - |
dc.citation.publicationname | JOURNAL OF THE ACM | - |
dc.identifier.doi | 10.1145/3486655 | - |
dc.contributor.localauthor | Kim, Eunjung | - |
dc.contributor.nonIdAuthor | Bonnet, Edouard | - |
dc.contributor.nonIdAuthor | Thomasse, Stephan | - |
dc.contributor.nonIdAuthor | Watrigant, Remi | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Contraction sequence | - |
dc.subject.keywordAuthor | FO model checking | - |
dc.subject.keywordAuthor | fixed-parameter tractability | - |
dc.subject.keywordPlus | COMPLEXITY | - |
dc.subject.keywordPlus | 1ST-ORDER | - |
dc.subject.keywordPlus | GRAPHS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.