Imagen de Portada

Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Mukherjee, Sayan, Akiyama, Shinichiro
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Combinatorics Quantum Physics F.2.2; G.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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)

Maintaining Routing Structures under Deletions via Self-Pruning
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
por: Haeupler, Bernhard, et al.
Publicado: (2023)

Structural Parameterization of Steiner Tree Packing
por: Hastrich, Niko, et al.
Publicado: (2025)

JFR: An Efficient Jump Frontier Relaxation Strategy for Bellman-Ford
por: Wang, Xin, et al.
Publicado: (2025)

Customizable Contraction Hierarchies -- A Survey
por: Bläsius, Thomas, et al.
Publicado: (2025)

Faster shortest-path algorithms using the acyclic-connected tree
por: Stefansson, Elis, et al.
Publicado: (2025)

Fast and Simple Sorting Using Partial Information
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
por: Dereniowski, Dariusz, et al.
Publicado: (2024)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
por: Balzotti, Lorenzo
Publicado: (2020)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
por: Dreier, Jan, et al.
Publicado: (2026)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Graph Threading
por: Demaine, Erik D., et al.
Publicado: (2023)

Approximation Algorithms for Action-Reward Query-Commit Matching
por: Derakhshan, Mahsa, et al.
Publicado: (2026)

Better coloring of 3-colorable graphs
por: Kawarabayashi, Ken-ichi, et al.
Publicado: (2024)

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

Kernelization dichotomies for hitting minors under structural parameterizations
por: Bougeret, Marin, et al.
Publicado: (2025)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
por: Bougeret, Marin, et al.
Publicado: (2024)

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
por: Kumar, Nikhil, et al.
Publicado: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
por: Jansson, Jesper, et al.
Publicado: (2024)

Multiplication of 0-1 matrices via clustering
por: Jansson, Jesper, et al.
Publicado: (2025)

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)

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

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

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

Graph Threading with Turn Costs
por: Demaine, Erik D., et al.
Publicado: (2024)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
por: Dvořák, Pavel, et al.
Publicado: (2017)

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

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
por: Le, Hung, et al.
Publicado: (2023)

Realizing temporal graphs from fastest travel times
por: Klobas, Nina, et al.
Publicado: (2023)

A Piecewise Approach for the Analysis of Exact Algorithms
por: Clinch, Katie, et al.
Publicado: (2024)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
por: Kumar, Nikhil, et al.
Publicado: (2025)

Backdoors for Quantified Boolean Formulas
por: Eriksson, Leif, et al.
Publicado: (2026)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
por: Dabrowski, Konrad K., et al.
Publicado: (2024)

Fast approximate $\ell$-center clustering in high dimensional spaces
por: Kowaluk, Mirosław, et al.
Publicado: (2025)

Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
por: Lingas, Andrzej
Publicado: (2024)

A $2$-branching construction for the $χ\leq 2r$ bound
por: Date, Vinicius Tikara Venturi, et al.
Publicado: (2026)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
por: Bampis, Evripidis, et al.
Publicado: (2024)