Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts
From MaRDI portal
Publication:6039417
DOI10.1007/978-3-031-15914-5_8arXiv2202.13661OpenAlexW4312298349MaRDI QIDQ6039417
Cornelius Brand, Robert Ganian, Christian Hatschka, Esra Ceylan, Viktoriia Korchemna
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.13661
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Sparsity. Graphs, structures, and algorithms
- The structure of graphs not admitting a fixed immersion
- On the complexity of some colorful problems parameterized by treewidth
- Constraint satisfaction with bounded treewidth revisited
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- An FPT 2-approximation for tree-cut decomposition
- The complexity landscape of decompositional parameters for ILP
- New algorithms for maximum disjoint paths based on tree-likeness
- On structural parameterizations of the edge disjoint paths problem
- Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space
- On structural parameterizations of the bounded-degree vertex deletion problem
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability
- The power of cut-based parameters for computing edge-disjoint paths
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth
- Algorithmic Applications of Tree-Cut Width
- Graph Layout Problems Parameterized by Vertex Cover
- Graph minors. II. Algorithmic aspects of tree-width
- Approximating rank-width and clique-width quickly
- Immersions in Highly Edge Connected Graphs
- Twin-width I: Tractable FO Model Checking
- Lean Tree-Cut Decompositions: Obstructions and Algorithms
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
- Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters
- Parameterized complexity of min-power asymmetric connectivity
This page was built for publication: Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts
