Imagen de Portada

Thin Trees via $k$-Respecting Cut Identities

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Daga, Mohit
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Cuts in Graphs with Matroid Constraints
por: Banik, Aritra, et al.
Publicado: (2024)

EPTAS for Hard Graph Cut Problems for Dense Graphs
por: Deguchi, Kaisei, et al.
Publicado: (2026)

Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families
por: Chen, Yu, et al.
Publicado: (2023)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
por: Deák, Bence, et al.
Publicado: (2026)

On the number of $k$-mers admitting a given lexicographical minimizer
por: Ingels, Florian, et al.
Publicado: (2024)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
por: Deligkas, Argyrios, et al.
Publicado: (2025)

Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
por: Ingels, Florian, et al.
Publicado: (2026)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
por: Galby, Esther, et al.
Publicado: (2025)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
por: Arkhipov, Pavel, et al.
Publicado: (2024)

Sampling Tree-Weighted Partitions Without Sampling Trees
por: Cannon, Sarah, et al.
Publicado: (2025)

On The Maximum Linear Arrangement Problem for Trees
por: Alemany-Puig, Lluís, et al.
Publicado: (2023)

Induced Minors and Coarse Tree Decompositions
por: Chudnovsky, Maria, et al.
Publicado: (2026)

Traversing combinatorial 0/1-polytopes via optimization
por: Merino, Arturo, et al.
Publicado: (2023)

On the Enumeration of all Unique Paths of Recombining Trinomial Trees
por: Torres, Ethan, et al.
Publicado: (2025)

Dvorak-Dell-Grohe-Rattan theorem via an asymptotic argument
por: Kozachinskiy, Alexander
Publicado: (2025)

Generalising the maximum independent set algorithm via Boolean networks
por: Gadouleau, Maximilien, et al.
Publicado: (2024)

Tree Independence Number IV. Even-hole-free Graphs
por: Chudnovsky, Maria, et al.
Publicado: (2024)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
por: Korhonen, Tuukka, et al.
Publicado: (2024)

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
por: Ameli, Afrouz Jabal, et al.
Publicado: (2026)

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
por: Jeronimo, Fernando Granha, et al.
Publicado: (2022)

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
por: Jenssen, Matthew, et al.
Publicado: (2023)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
por: Bencs, Ferenc, et al.
Publicado: (2024)

Finding $d$-Cuts in Probe $H$-Free Graphs
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
por: Daga, Mohit
Publicado: (2025)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
por: Lucke, Felicia, et al.
Publicado: (2023)

On graphs coverable by k shortest paths
por: Dumas, Maël, et al.
Publicado: (2022)

The Strong Birthday Problem Revisited
por: Tripathy, Chijul B.
Publicado: (2025)

Reconfiguration of List Colourings
por: Cambie, Stijn, et al.
Publicado: (2025)

Parameterized complexity of isometric path partition: treewidth and diameter
por: Chakraborty, Dibyayan, et al.
Publicado: (2025)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
por: Ghanbari, Babak, et al.
Publicado: (2025)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
por: An, Shinwoo, et al.
Publicado: (2025)

Optimal and Efficient Partite Decompositions of Hypergraphs
por: Krapivin, Andrew, et al.
Publicado: (2025)

Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
por: Shook, James M., et al.
Publicado: (2025)

Parameterised algorithms for temporally satisfying reconfiguration problems
por: Davot, Tom, et al.
Publicado: (2025)

Computing Treedepth Obstructions
por: Kühn, Kolja
Publicado: (2025)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
por: Bencs, Ferenc, et al.
Publicado: (2025)

Interval H-graphs : Recognition and forbidden obstructions
por: Müller, Haiko, et al.
Publicado: (2025)

Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
por: Kita, Nanano
Publicado: (2025)

Twin-width one
por: Ahn, Jungho, et al.
Publicado: (2025)

Capturing an Invisible Robber using Separators
por: Potapov, Igor, et al.
Publicado: (2025)