Cover Image

A Note on Generic Tangle Algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Elbracht, Christian, Kneip, Jay Lilian, Teegen, Maximilian
Format:	Preprint
Published:	2020
Subjects:	Combinatorics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tangles are Decided by Weighted Vertex Sets
by: Elbracht, Christian, et al.
Published: (2018)

Agile Sets in Graphs
by: Elbracht, Christian, et al.
Published: (2021)

Obtaining trees of tangles from tangle-tree duality
by: Elbracht, Christian, et al.
Published: (2020)

The Structure of Submodular Separation Systems
by: Elbracht, Christian, et al.
Published: (2021)

The Unravelling Problem
by: Elbracht, Christian, et al.
Published: (2021)

Trees of tangles in abstract separation systems
by: Elbracht, Christian, et al.
Published: (2019)

Notes on the Linear Algebraic View of Regularity Lemmas
by: Bodwin, Greg, et al.
Published: (2025)

Trees of tangles in infinite separation systems
by: Elbracht, Christian, et al.
Published: (2020)

A Lower Bound for the Max Entropy Algorithm for TSP
by: Jin, Billy, et al.
Published: (2023)

A Faster Deterministic Approximation Algorithm for TTP-2
by: Kanaya, Yuga, et al.
Published: (2023)

A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications
by: Dumitrescu, Adrian
Published: (2024)

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
by: Dhawan, Abhishek
Published: (2024)

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
by: Jones, Mark, et al.
Published: (2025)

Triangle-Covered Graphs: Algorithms, Complexity, and Structure
by: Madani, Amirali, et al.
Published: (2025)

Complexity and Algorithm for the Matching vertex-cutset Problem
by: Li, Hengzhe, et al.
Published: (2025)

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
by: Haviv, Ishay
Published: (2022)

A Linear-Time Algorithm for Finding an Odd Cycle Through Two Specified Vertices
by: Kano, Takumi, et al.
Published: (2026)

Algorithmic study on liar's vertex-edge domination problem
by: Bhattacharya, Debojyoti, et al.
Published: (2023)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
by: Mu, Ta-Yu, et al.
Published: (2024)

Above-Guarantee Algorithm for Properly Colored Spanning Trees
by: Bai, Yuhang, et al.
Published: (2026)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
by: Gavva, Surya Teja, et al.
Published: (2025)

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
by: Norose, Ryoma, et al.
Published: (2024)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
by: Murakami, Hitoshi, et al.
Published: (2024)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
by: Korhonen, Tuukka
Published: (2024)

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
by: Kuszmaul, William
Published: (2025)

Random Generation of Git Graphs
by: Courtiel, Julien, et al.
Published: (2024)

Engineering Data Reduction for Nested Dissection
by: Ost, Lara, et al.
Published: (2020)

Reconfiguration Using Generalized Token Jumping
by: Křišťan, Jan Matyáš, et al.
Published: (2024)

Short circuit walks in fixed dimension
by: Black, Alexander E., et al.
Published: (2025)

Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
by: Karamchedu, Mithra, et al.
Published: (2025)

Analysis of a Random Local Search Algorithm for Dominating Set
by: Higl, Hendrik
Published: (2026)

A Uniformly Random Solution to Algorithmic Redistricting
by: Cai, Jin-Yi, et al.
Published: (2024)

A Combinatorial Characterization of Constant Mixing Time
by: Lau, Lap Chi, et al.
Published: (2025)

A note on Ordered Ruzsa-Szemerédi graphs
by: Pratt, Kevin
Published: (2025)

A Maximum Linear Arrangement Problem on Directed Graphs
by: DeVos, Matt, et al.
Published: (2018)

A Unified View of Graph Regularity via Matrix Decompositions
by: Bodwin, Greg, et al.
Published: (2019)

A faster algorithm for Vertex Cover parameterized by solution size
by: Harris, David G., et al.
Published: (2022)

A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three
by: Chalermsook, Parinya, et al.
Published: (2025)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
by: Jenssen, Matthew, et al.
Published: (2024)

A Minimum Counterexample Proof of the Seymour Second Neighborhood Conjecture via the Graph Level Order
by: Glover, Charles N.
Published: (2024)