:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Davies, Ewan, Job, Ryan, Kampbell, Maxine, Kim, Hannah, Seo, Hyojin
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Physics and Society
Online Access:	https://arxiv.org/abs/2506.13982
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bonsai: A class of effective methods for independent sampling of graph partitions
by: Clelland, Jeanne, et al.
Published: (2026)

Local dominance unveils clusters in networks
by: Shi, Dingyi, et al.
Published: (2022)

On the occupancy fraction of the antiferromagnetic Ising model
by: Davies, Ewan, et al.
Published: (2024)

On $k$-connectivity oracles in $k$-connected graphs
by: Nutov, Zeev
Published: (2026)

Sampling List Packings
by: Camrud, Evan, et al.
Published: (2024)

The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions
by: McWhorter, Atticus, et al.
Published: (2025)

Minimal Algorithmic Information Loss Methods for Dimension Reduction, Feature Selection and Network Sparsification
by: Zenil, Hector, et al.
Published: (2018)

Efficient algorithms for the Potts model on small-set expanders
by: Carlson, Charles, et al.
Published: (2020)

Dynamic framework for edge-connectivity maintenance of simple graphs
by: Wrobel, Blazej
Published: (2026)

An improvement of degree-based hashing (DBH) graph partition method, using a novel metric
by: Mastikhina, Anna, et al.
Published: (2024)

Balanced TSP partitioning
by: Berendsohn, Benjamin Aram, et al.
Published: (2025)

On 2-strong connectivity orientations of mixed graphs and related problems
by: Georgiadis, Loukas, et al.
Published: (2023)

Balanced Spanning Tree Distributions Have Separation Fairness
by: Chen, Harry, et al.
Published: (2025)

Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search
by: Brous, Daniel, et al.
Published: (2025)

Ranking with Partitioning
by: Boardman, Samuel
Published: (2026)

Construction and Preliminary Validation of a Dynamic Programming Concept Inventory
by: Ferland, Matthew, et al.
Published: (2024)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
by: Jaberi, Raed, et al.
Published: (2024)

Quantum property testing in sparse directed graphs
by: Apers, Simon, et al.
Published: (2024)

Symmetry-breaking symmetry in directed spectral partitioning
by: Pasadakis, Dimosthenis, et al.
Published: (2025)

Simulating Gaussian boson sampling on graphs in polynomial time
by: Anand, Konrad, et al.
Published: (2025)

The connectivity carcass of a vertex subset in a graph: both odd and even case
by: Baswana, Surender, et al.
Published: (2025)

Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
by: Davari, Morteza, et al.
Published: (2025)

SPAM Tolerance for Pauli Error Estimation
by: O'Donnell, Ryan, et al.
Published: (2025)

Quantum chi-squared tomography and mutual information testing
by: Flammia, Steven T., et al.
Published: (2023)

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
by: Wesołowski, Adam, et al.
Published: (2025)

On the non-submodularity of the problem of adding links to minimize the effective graph resistance
by: Achterberg, Massimo A., et al.
Published: (2025)

Distributed Quantum Property Testing with Communication Constraints
by: Doosti, Mina, et al.
Published: (2026)

Explaining Rankings with Hidden Group Bonuses
by: Yan, Alvin Hong Yao, et al.
Published: (2026)

Dependent randomized rounding for clustering and partition systems with knapsack constraints
by: Harris, David G., et al.
Published: (2017)

Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact
by: Wang, Qingwen, et al.
Published: (2024)

Few Single-Qubit Measurements Suffice to Certify Any Quantum State
by: Gupta, Meghal, et al.
Published: (2025)

Designing sparse temporal graphs satisfying connectivity requirements
by: Bellitto, Thomas, et al.
Published: (2026)

Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
by: Davies-Peck, Peter
Published: (2026)

Query-optimal estimation of unitary channels in diamond distance
by: Haah, Jeongwan, et al.
Published: (2023)

Bicriteria approximation for $k$-edge-connectivity
by: Nutov, Zeev, et al.
Published: (2025)

Directed st-connectivity with few paths is in quantum logspace
by: Apers, Simon, et al.
Published: (2024)

Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width
by: Kluk, Kacper, et al.
Published: (2025)

Improved bicriteria approximation for $k$-edge-connectivity
by: Nutov, Zeev
Published: (2025)

Simple parallel estimation of the partition ratio for Gibbs distributions
by: Harris, David G., et al.
Published: (2025)

Matchings Under Biased and Correlated Evaluations
by: Kumar, Amit, et al.
Published: (2025)