Imagen de Portada

Faster Mixing for Triangulations via Transport Flows

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Alev, Vedat Levi, Frishberg, Daniel, Sarantis, Michail, Tetali, Prasad
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics Computational Geometry Discrete Mathematics Data Structures and Algorithms 05 G.2; G.3; F.2.0
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
por: Chen, Yongyu
Publicado: (2023)

Efficient Approximation of Fractional Hypertree Width
por: Korchemna, Viktoriia, et al.
Publicado: (2024)

Cluster deletion and clique partitioning in graphs with bounded clique number
por: Galesi, Nicola, et al.
Publicado: (2025)

Online Bipartite Matching in the Probe-Commit Model
por: Borodin, Allan, et al.
Publicado: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
por: Ma, Will, et al.
Publicado: (2024)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
por: MacRury, Calum, et al.
Publicado: (2022)

On some randomized algorithms and their evaluation
por: Yordzhev, Krasimir
Publicado: (2024)

Solving Modular Linear Systems with a Constraint by parallel decomposition of the Smith form and extended Euclidean division modulo powers of primes divisors
por: Sule, Virendra
Publicado: (2025)

Temporalizing digraphs via linear-size balanced bi-trees
por: Bessy, Stéphane, et al.
Publicado: (2023)

Weisfeiler-Leman on graphs of small twin-width
por: Heinrich, Irene, et al.
Publicado: (2026)

On Relaxation of Dominant Sets
por: Koster, Max
Publicado: (2022)

Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
por: Bonnet, Édouard, et al.
Publicado: (2023)

Local generation of languages
por: Hoyrup, Mathieu
Publicado: (2025)

Local generation of languages: the monotonic binary sequences
por: Hoyrup, Mathieu
Publicado: (2026)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
por: Masařík, Tomáš, et al.
Publicado: (2026)

Random Schreier graphs as expanders
por: Caillat-Grenier, Geoffroy
Publicado: (2023)

Lower Bounds for Leaf Rank of Leaf Powers
por: Høgemo, Svein
Publicado: (2024)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
por: Bourneuf, Romain, et al.
Publicado: (2025)

Optimal distance query reconstruction for graphs without long induced cycles
por: Bastide, Paul, et al.
Publicado: (2023)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
por: Adamson, Duncan, et al.
Publicado: (2023)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
por: Shota, Kan, et al.
Publicado: (2024)

Improved Outerplanarity Bounds for Planar Graphs
por: Biedl, Therese, et al.
Publicado: (2024)

Deterministic Minimum Steiner Cut in Maximum Flow Time
por: Ding, Matthew, et al.
Publicado: (2023)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
por: Könen, David, et al.
Publicado: (2023)

An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands
por: Shalaby, Ahmed, et al.
Publicado: (2024)

Flip-width: Cops and Robber on dense graphs
por: Toruńczyk, Szymon
Publicado: (2023)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
por: Streit, Robert P., et al.
Publicado: (2024)

List Coloring of some Cayley graphs using Kernel perfections
por: S, Prajnanaswaroopa
Publicado: (2024)

Alon-Tarsi Number of Some Regular Graphs
por: Prajnanaswaroopa, S.
Publicado: (2023)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
por: Patzner, Julian, et al.
Publicado: (2024)

Explicit two-sided unique-neighbor expanders
por: Hsieh, Jun-Ting, et al.
Publicado: (2023)

Reducing Matroid Optimization to Basis Search
por: Streit, Robert, et al.
Publicado: (2024)

An Efficient Algorithm for Permutation Iteration Using a Singly Linked List
por: Baruchel, Thomas
Publicado: (2025)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
por: Kavi, Nithin
Publicado: (2024)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
por: Eiben, Eduard, et al.
Publicado: (2023)

Forward-backward Contention Resolution Schemes for Fair Rationing
por: Ma, Will, et al.
Publicado: (2025)

A polynomial-time algorithm for recognizing high-bandwidth graphs
por: Varona, Luis M. B.
Publicado: (2026)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
por: Ibrahimpur, Sharat, et al.
Publicado: (2025)

Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes
por: Cunha, Luís Felipe I., et al.
Publicado: (2025)

Polymer Dynamics via Cliques: New Conditions for Approximations
por: Friedrich, Tobias, et al.
Publicado: (2020)