Imagen de Portada

Markovian protocols and an upper bound on the extension complexity of the matching polytope

Fuente: arXiv

Guardado en:

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

Ejemplares similares

Deterministic approximation for the volume of the truncated fractional matching polytope
por: Guo, Heng, et al.
Publicado: (2024)

Clique-free t-matchings in degree-bounded graphs
por: Paluch, Katarzyna, et al.
Publicado: (2024)

Complexity of polytope diameters via perfect matchings
por: Nöbel, Christian, et al.
Publicado: (2024)

Triangle-free 2-matchings
por: Paluch, Katarzyna
Publicado: (2023)

Reconfiguration of labeled matchings in triangular grid graphs
por: Kakimura, Naonori, et al.
Publicado: (2024)

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

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

Finding perfect matchings in bridgeless cubic multigraphs without dynamic (2-)connectivity
por: Gawrychowski, Paweł, et al.
Publicado: (2024)

A survey of Chernoff and Hoeffding bounds
por: Gerbessiotis, Alexandros V.
Publicado: (2025)

Packing $K_r$s in bounded degree graphs
por: McKay, Michael, et al.
Publicado: (2022)

Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
por: Paul-Pena, Daniel, et al.
Publicado: (2025)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
por: Foucaud, Florent, et al.
Publicado: (2025)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
por: Jain, Vishesh, et al.
Publicado: (2026)

Improved bounds for coloring locally sparse hypergraphs
por: Iliopoulos, Fotis
Publicado: (2020)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
por: Alecu, Bogdan, et al.
Publicado: (2024)

Quasi-linear distance query reconstruction for graphs of bounded treelength
por: Bastide, Paul, et al.
Publicado: (2024)

Translating between the representations of an acyclic convex geometry of bounded degree
por: Defrain, Oscar, et al.
Publicado: (2025)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
por: Bonamy, Marthe, et al.
Publicado: (2020)

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

Separable convex optimization over indegree polytopes
por: Borsik, Nóra A., et al.
Publicado: (2025)

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

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

On the complexity of finding a spanning even tree in a graph
por: Hanaka, Tesshu, et al.
Publicado: (2024)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
por: Chakraborty, Dibyayan, et al.
Publicado: (2024)

Online Graph Balancing and the Power of Two Choices
por: Bansal, Nikhil, et al.
Publicado: (2026)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
por: Disser, Yann, et al.
Publicado: (2024)

H-Planarity and Parametric Extensions: when Modulators Act Globally
por: Fomin, Fedor V., et al.
Publicado: (2025)

Graph Visualization for Blockchain Data
por: Dietl, Marcell, et al.
Publicado: (2024)

Fast Makespan Minimization via Short ILPs
por: Hermelin, Danny, et al.
Publicado: (2026)

A Unified Approach to Minimizing Symmetric Submodular Functions
por: Iwata, Satoru, et al.
Publicado: (2026)

Optimal Enumeration of Eulerian Trails in Directed Graphs
por: Bals, Ben, et al.
Publicado: (2026)

Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
por: Komusiewicz, Christian, et al.
Publicado: (2026)

Minimum Sum Set Cover: Structures and Algorithm
por: Zhang, Zhongyi, et al.
Publicado: (2026)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
por: Abbasi, Ali, et al.
Publicado: (2026)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
por: Foucaud, Florent, et al.
Publicado: (2026)

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
por: German, Samuel
Publicado: (2026)

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
por: Rosenke, Christian, et al.
Publicado: (2026)

Node-Weighted Triangles: Faster and Simpler
por: Akmal, Shyan, et al.
Publicado: (2026)

Terminal Steiner tree problem : Complexity and Algorithms
por: S, Jyothish, et al.
Publicado: (2026)

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
por: Dutta, Kunal, et al.
Publicado: (2026)