Imagen de Portada

Graph Inference with Effective Resistance Queries

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bennett, Huck, Black, Mitchell, Nayyeri, Amir, Warton, Evelyn
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Discrete Mathematics Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries
por: Black, Hadley, et al.
Publicado: (2025)

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
por: Liao, Meihao, et al.
Publicado: (2025)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
por: Xue, Jinghui, et al.
Publicado: (2024)

Triangle Detection in H-Free Graphs
por: Abboud, Amir, et al.
Publicado: (2025)

Non-adaptive Learning of Random Hypergraphs with Queries
por: Austhof, Bethany, et al.
Publicado: (2025)

Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms
por: Davies, Sami, et al.
Publicado: (2025)

Exact Causal Attention with 10% Fewer Operations
por: Rybin, Dmitry, et al.
Publicado: (2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
por: Crane, Alex, et al.
Publicado: (2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
por: Veldt, Nate, et al.
Publicado: (2025)

Worst-case Error Bounds for Online Learning of Smooth Functions
por: Xie, Weian
Publicado: (2025)

Foundational theory for optimal decision tree problems. I. Algorithmic and geometric foundations
por: He, Xi
Publicado: (2025)

Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis
por: Sharman, Bharat, et al.
Publicado: (2025)

Optimal hypersurface decision trees
por: He, Xi
Publicado: (2025)

Partial Optimality in the Preordering Problem
por: Stein, David, et al.
Publicado: (2026)

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
por: Tukan, Murad, et al.
Publicado: (2024)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
por: Chen, Yixin, et al.
Publicado: (2024)

Breaking Hard Isomorphism Benchmarks with DRESS
por: Velilla, Eduar Castrillo
Publicado: (2026)

A 4-approximation algorithm for min max correlation clustering
por: Heidrich, Holger, et al.
Publicado: (2023)

Total Variation Distance Meets Probabilistic Inference
por: Bhattacharyya, Arnab, et al.
Publicado: (2023)

Are Graph Neural Networks Optimal Approximation Algorithms?
por: Yau, Morris, et al.
Publicado: (2023)

The Computational Complexity of Positive Non-Clashing Teaching in Graphs
por: Ganian, Robert, et al.
Publicado: (2025)

Learning to Prune Instances of Steiner Tree Problem in Graphs
por: Zhang, Jiwei, et al.
Publicado: (2022)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
por: Abboud, Amir, et al.
Publicado: (2025)

Online Graph Coloring for $k$-Colorable Graphs
por: Kawarabayashi, Ken-ichi, et al.
Publicado: (2025)

Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
por: Zhang, Bohang, et al.
Publicado: (2024)

Stability in Graphs with Matroid Constraints
por: Fomin, Fedor V., et al.
Publicado: (2024)

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

Temporal Graph Realization With Bounded Stretch
por: Mertzios, George B., et al.
Publicado: (2025)

Distance-Preserving Graph Compression Techniques
por: Madani, Amirali, et al.
Publicado: (2023)

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

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

Optimal Padded Decomposition For Bounded Treewidth Graphs
por: Filtser, Arnold, et al.
Publicado: (2024)

FO and MSO Model Checking on Temporal Graphs
por: Döring, Michelle, et al.
Publicado: (2026)

Tight Paths and Tight Pairs in Weighted Directed Graphs
por: Balcázar, José Luis
Publicado: (2025)

Exponential Time Approximation for Coloring 3-Colorable Graphs
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
por: Dahan, Anatole, et al.
Publicado: (2026)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
por: Hamm, Thekla, et al.
Publicado: (2022)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
por: Mömke, Tobias, et al.
Publicado: (2024)

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
por: Paul-Pena, Daniel, et al.
Publicado: (2024)

Algorithmic Results for Weak Roman Domination Problem in Graphs
por: Paul, Kaustav, et al.
Publicado: (2024)