Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes

The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes. First-order interpretations and transductions of...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Author: Dreier, Jan
Format: Conference Proceeding
Language:English
Published: IEEE 29.06.2021
Subjects:
Computational modeling
Computer science
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes. First-order interpretations and transductions of sparse graph classes lead to more general, dense graph classes that seem to inherit many of the nice algorithmic properties of their sparse counterparts.In this work we introduce lacon- and shrub-decompositions and use them to characterize transductions of bounded expansion graph classes and other graph classes. If one can efficiently compute sparse shrub- or lacon-decompositions of transductions of bounded expansion classes then one can solve every problem definable in first-order logic in linear time on these classes.
AbstractList The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes. First-order interpretations and transductions of sparse graph classes lead to more general, dense graph classes that seem to inherit many of the nice algorithmic properties of their sparse counterparts.In this work we introduce lacon- and shrub-decompositions and use them to characterize transductions of bounded expansion graph classes and other graph classes. If one can efficiently compute sparse shrub- or lacon-decompositions of transductions of bounded expansion classes then one can solve every problem definable in first-order logic in linear time on these classes.
Author Dreier, Jan
Author_xml – sequence: 1
  givenname: Jan
  surname: Dreier
  fullname: Dreier, Jan
  email: dreier@ac.tuwien.at.at
  organization: TU Wien,Austria
BookMark eNotkMtOwzAURI0EElD6BUjIP5By7TgPs4PQQqWILlrW1Y19rQa1TrFT8fh6CHQ1izNnFnPJTn3nibEbARMhQN_W82qZSZmriQQpJloVkJdwwsa6KEWeZ0qVOsvP2TjGNwCQZSFA6Qv2XqPpfMLRW77chEOTPJLpdvsutn3b-XjH7_kLffBqgwFNT6H9xgHwzvFZG2KfLIKlwFcBfbQH8ycN8KE7eEuWTz_3v2Qwqi3GSPGKnTncRhofc8ReZ9NV9ZzUi6d5dV8nKEvdJ6JRxllTNg0WDaZCU07kZJpBCbrRrrBA2iC6xikLYKRTSueoNDgYaumIXf_vtkS03od2h-FrfTwm_QENeF3n
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS52264.2021.9470680
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 Computer Science
EISBN 9781665448956
1665448954
EndPage 13
ExternalDocumentID 9470680
Genre orig-research
GroupedDBID 6IE
6IH
ACM
ALMA_UNASSIGNED_HOLDINGS
APO
CBEJK
GUFHI
LHSKQ
RIE
RIO
ID FETCH-LOGICAL-a289t-1b4cfdc8bba7ba319e6eef2350809b9f7d0e9caafbf4d00c2f4496a490f0f2353
IEDL.DBID RIE
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000947350400069&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:23:08 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a289t-1b4cfdc8bba7ba319e6eef2350809b9f7d0e9caafbf4d00c2f4496a490f0f2353
PageCount 13
ParticipantIDs ieee_primary_9470680
PublicationCentury 2000
PublicationDate 2021-June-29
PublicationDateYYYYMMDD 2021-06-29
PublicationDate_xml – month: 06
  year: 2021
  text: 2021-June-29
  day: 29
PublicationDecade 2020
PublicationTitle Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev LICS
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002871049
Score 2.2462323
Snippet The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Computational modeling
Computer science
Title Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes
URI https://ieeexplore.ieee.org/document/9470680
WOSCitedRecordID wos000947350400069&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/eLvHCXMwlV1LS8NAEF7a4sFT1VZ8swePbrtJk2zWm9YWhVILVeit7GMWe0m1D_Hnu5OkEcGLt5AHgV1m5svk--Yj5DpxwhcN51joUsUiK42POeeToUf3BkIe66gwmxDjcTqbyUmN3FRaGADIyWfQwcP8X75dmi22yroyEmgVUSd1IUSh1ar6KYj8PdotRcABl93RU3-K6AI7J2HQKR_-5aKSF5Fh83-vPyDtHzUenVR15pDUIDsizZ0dAy2js0U-Rj67ZYyqzNLp22qr2QMgY3xHy7qld9TnNNqvZjQXEky6dHS48CiQPeMcTpqXL1tMlV3jxXu0XgJLB18-dWB3jeZWmrBuk9fh4KX_yEpHBab8h9WGBToyzppUayW08tEHCYALex6lcamlE5aDNEo5pO9xbkIXRTJRkeSO4229Y9LIlhmcEJooZ0OudWw8qEk8RBfKBSlwi4AnTtJT0sIVnL8XQzPm5eKd_X36nOzjJiEHK5QXpLFZbeGS7JnPzWK9usp3-huY2qvF
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEN4gmugJFYxv9-DR4nbZPtabIgRiRRIw4Ub2GbkU5WH8-e60pcbEi7emj6TZzcx8nX7ffAhdhzZyRcNaj9pYeExz5WLOumTo0L0ylASS5WYT0WAQTyZ8WEE3pRbGGJORz0wTDrN_-Xqu1tAqu-UsAquILbQdMEb9XK1VdlQA-zu8W8iAfcJvk357BPgCeifUbxaP__JRycpIt_a_F9hHjR89Hh6WleYAVUx6iGobQwZcxGcdfSQuv6UeFqnGo7fFWnqPBjjjG2LWHb7HLqvhdjmlORdh4rnF3ZnDgd4LTOLEWQHT-VzZJVx8APMlo3HnyyUP6K_hzEzTLBvotdsZt3te4angCfdptfJ8yZTVKpZSRFK4-DOhMZa2HE4jXHIbaWK4EsICgY8QRS1jPBSME0vgttYRqqbz1BwjHAqrKZEyUA7WhA6kR8L6sSEaIE8QxieoDis4fc_HZkyLxTv9-_QV2u2Nn5Np0h88naE92DBgZFF-jqqrxdpcoB31uZotF5fZrn8DskmvDA
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+of+the+36th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Lacon-+and+Shrub-Decompositions%3A+A+New+Characterization+of+First-Order+Transductions+of+Bounded+Expansion+Classes&rft.au=Dreier%2C+Jan&rft.date=2021-06-29&rft.pub=IEEE&rft.spage=1&rft.epage=13&rft_id=info:doi/10.1109%2FLICS52264.2021.9470680&rft.externalDocID=9470680