NDLI: Computing with Tangles

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Schweitzer, Pascal Grohe, Martin
Copyright Year	2016
Abstract	Tangles of graphs have been introduced by Robertson and Seymour in the context of their graph minor theory. Tangles may be viewed as describing $k$-connected components of a graph (though in a twisted way). An interesting aspect of tangles is that they can be defined not only for graphs, but more generally for arbitrary connectivity functions (that is, integer-valued submodular and symmetric set functions). However, tangles are difficult to deal with algorithmically. To start with, it is unclear how to represent them, because they are families of separations and, as such, may be exponentially large. Our first contribution is a data structure for representing and accessing all tangles of a graph up to some fixed order. Using this data structure, we can prove an algorithmic version of a very general structure theorem due to Carmesin et al. (for graphs) and Hundertmark (for arbitrary connectivity functions) that yields a canonical tree decomposition whose parts correspond to the maximal tangles. This may be viewed as a generalization of the decomposition of a graph into its 3-connected components.
Sponsorship	Deutsche Forschungsgemeinschaft
Starting Page	1213
Ending Page	1247
Page Count	35
File Format	PDF
ISSN	08954801
DOI	10.1137/15M1027565
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	2
Volume Number	30
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2016-06-09
Access Restriction	Subscribed
Subject Keyword	tangle Connectivity Graph theory connectivity function tree decomposition
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Refining a Tree-Decomposition which Distinguishes Tangles

Obtaining trees of tangles from tangle-tree duality

$k$-Blocks: A Connectivity Invariant for Graphs

Computing with Tangles

Tangle-tree duality in abstract separation systems

Tangle-tree duality: in graphs, matroids and beyond

Characterising 4-tangles through a connectivity property

Graph Ear Decompositions and Graph Embeddings

A tree-of-tangles theorem for infinite tangles

Computing with Tangles

Similar Documents

Refining a Tree-Decomposition which Distinguishes Tangles

Obtaining trees of tangles from tangle-tree duality

$k$-Blocks: A Connectivity Invariant for Graphs

Computing with Tangles

Tangle-tree duality in abstract separation systems

Tangle-tree duality: in graphs, matroids and beyond

Characterising 4-tangles through a connectivity property

Graph Ear Decompositions and Graph Embeddings

A tree-of-tangles theorem for infinite tangles

Computing with Tangles