Saved in:
| Main Authors: | Carlson, Charlie, Vigoda, Eric |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.04870 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Improved Distributed Algorithms for Random Colorings
by: Carlson, Charlie, et al.
Published: (2023)
by: Carlson, Charlie, et al.
Published: (2023)
Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
by: Carlson, Charlie, et al.
Published: (2024)
by: Carlson, Charlie, et al.
Published: (2024)
Sampling Simultaneous Edge-Colorings
by: Furtado-Tiwari, Ezra, et al.
Published: (2026)
by: Furtado-Tiwari, Ezra, et al.
Published: (2026)
Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
by: Jain, Vishesh, et al.
Published: (2026)
by: Jain, Vishesh, et al.
Published: (2026)
Spectral Independence and Local-to-Global Techniques for Optimal Mixing of Markov Chains
by: Chen, Zongchen, et al.
Published: (2023)
by: Chen, Zongchen, et al.
Published: (2023)
Critical window for approximate counting in dense Ising models
by: Galanis, Andreas, et al.
Published: (2026)
by: Galanis, Andreas, et al.
Published: (2026)
Spectral Independence via Stability and Applications to Holant-Type Problems
by: Chen, Zongchen, et al.
Published: (2021)
by: Chen, Zongchen, et al.
Published: (2021)
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
by: Efthymiou, Charilaos, et al.
Published: (2023)
by: Efthymiou, Charilaos, et al.
Published: (2023)
Flips in colorful triangulations
by: Acharya, Rohan, et al.
Published: (2024)
by: Acharya, Rohan, et al.
Published: (2024)
Flips and Merge-Width in Sparse Graphs
by: Drabik, Karolina, et al.
Published: (2026)
by: Drabik, Karolina, et al.
Published: (2026)
Flipping Matchings is Hard
by: Binucci, Carla, et al.
Published: (2025)
by: Binucci, Carla, et al.
Published: (2025)
Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
by: Bok, Jan, et al.
Published: (2025)
by: Bok, Jan, et al.
Published: (2025)
The $ε$-$t$-Net Problem
by: Alon, Noga, et al.
Published: (2020)
by: Alon, Noga, et al.
Published: (2020)
Flip Paths Between Lattice Triangulations
by: Sims, William, et al.
Published: (2020)
by: Sims, William, et al.
Published: (2020)
Square-Triangle Tilings: Lift & Flip to Sample?
by: Fernique, Thomas, et al.
Published: (2024)
by: Fernique, Thomas, et al.
Published: (2024)
Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)
Constrained Flips in Plane Spanning Trees
by: Aichholzer, Oswin, et al.
Published: (2025)
by: Aichholzer, Oswin, et al.
Published: (2025)
$ε$-Uniform Mixing in Discrete Quantum Walks
by: Zhan, Hanmeng
Published: (2023)
by: Zhan, Hanmeng
Published: (2023)
Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees
by: Aichholzer, Oswin, et al.
Published: (2026)
by: Aichholzer, Oswin, et al.
Published: (2026)
Dynamical Stability of Threshold Networks over Undirected Signed Graphs
by: Goles, Eric, et al.
Published: (2023)
by: Goles, Eric, et al.
Published: (2023)
The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
Reducing Sensor Requirements by Relaxing the Network Metric Dimension
by: Mürmann, Paula, et al.
Published: (2025)
by: Mürmann, Paula, et al.
Published: (2025)
A Temporal Graph Model to Study the Dynamics of Collective Behavior and Performance in Team Sports: An Application to Basketball
by: Bourgeais, Quentin, et al.
Published: (2024)
by: Bourgeais, Quentin, et al.
Published: (2024)
Improving Data Cleaning Using Discrete Optimization
by: Smith, Kenneth, et al.
Published: (2024)
by: Smith, Kenneth, et al.
Published: (2024)
Coloring and Recognizing Directed Interval Graphs
by: Gutowski, Grzegorz, et al.
Published: (2023)
by: Gutowski, Grzegorz, et al.
Published: (2023)
Coloring Mixed and Directional Interval Graphs
by: Gutowski, Grzegorz, et al.
Published: (2022)
by: Gutowski, Grzegorz, et al.
Published: (2022)
Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)
by: Dailly, Antoine, et al.
Published: (2023)
Metric Dimensions of March Madness Brackets
by: Spiro, Sam
Published: (2026)
by: Spiro, Sam
Published: (2026)
First-Fit Coloring of Forests in Random Arrival Model
by: Bosek, Bartłomiej, et al.
Published: (2024)
by: Bosek, Bartłomiej, et al.
Published: (2024)
How to Color Temporal Graphs to Ensure Proper Transitions
by: Ibiapina, Allen, et al.
Published: (2025)
by: Ibiapina, Allen, et al.
Published: (2025)
Multiset Metric Dimension of Binomial Random Graphs
by: Eide, Austin, et al.
Published: (2025)
by: Eide, Austin, et al.
Published: (2025)
A Complexity Dichotomy for Generalized Rainbow Matchings Based on Color Classes
by: Hommelsheim, Felix, et al.
Published: (2026)
by: Hommelsheim, Felix, et al.
Published: (2026)
Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'
by: Anand, Bijo S., et al.
Published: (2025)
by: Anand, Bijo S., et al.
Published: (2025)
A linear-time algorithm for $(1+ε)Δ$-edge-coloring
by: Bernshteyn, Anton, et al.
Published: (2024)
by: Bernshteyn, Anton, et al.
Published: (2024)
Uniform Sampling and Visualization of 3D Reluctant Walks
by: Buckley, Benjamin, et al.
Published: (2024)
by: Buckley, Benjamin, et al.
Published: (2024)
On the Connectivity of the Flip Graph of Plane Spanning Paths
by: Kleist, Linda, et al.
Published: (2024)
by: Kleist, Linda, et al.
Published: (2024)
Improved Hotplug Caching Schemes Using PDAs and t-Designs
by: Rajput, Charul, et al.
Published: (2023)
by: Rajput, Charul, et al.
Published: (2023)
Counting Colored Tilings on Grids and Graphs
by: Ramírez, José L., et al.
Published: (2024)
by: Ramírez, José L., et al.
Published: (2024)
Coloring bridge-free antiprismatic graphs
by: Robin, Cléophée, et al.
Published: (2024)
by: Robin, Cléophée, et al.
Published: (2024)
Coloring Grids Avoiding Bicolored Paths
by: Keskinkilic, Derman, et al.
Published: (2023)
by: Keskinkilic, Derman, et al.
Published: (2023)
Similar Items
-
Improved Distributed Algorithms for Random Colorings
by: Carlson, Charlie, et al.
Published: (2023) -
Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
by: Carlson, Charlie, et al.
Published: (2024) -
Sampling Simultaneous Edge-Colorings
by: Furtado-Tiwari, Ezra, et al.
Published: (2026) -
Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
by: Jain, Vishesh, et al.
Published: (2026) -
Spectral Independence and Local-to-Global Techniques for Optimal Mixing of Markov Chains
by: Chen, Zongchen, et al.
Published: (2023)