Image de couverture de livre

Graph Inference with Effective Resistance Queries

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bennett, Huck, Black, Mitchell, Nayyeri, Amir, Warton, Evelyn
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Discrete Mathematics Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries
par: Black, Hadley, et autres
Publié: (2025)

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
par: Liao, Meihao, et autres
Publié: (2025)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
par: Xue, Jinghui, et autres
Publié: (2024)

Triangle Detection in H-Free Graphs
par: Abboud, Amir, et autres
Publié: (2025)

Non-adaptive Learning of Random Hypergraphs with Queries
par: Austhof, Bethany, et autres
Publié: (2025)

Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms
par: Davies, Sami, et autres
Publié: (2025)

Exact Causal Attention with 10% Fewer Operations
par: Rybin, Dmitry, et autres
Publié: (2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
par: Crane, Alex, et autres
Publié: (2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
par: Veldt, Nate, et autres
Publié: (2025)

Worst-case Error Bounds for Online Learning of Smooth Functions
par: Xie, Weian
Publié: (2025)

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

Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis
par: Sharman, Bharat, et autres
Publié: (2025)

Optimal hypersurface decision trees
par: He, Xi
Publié: (2025)

Partial Optimality in the Preordering Problem
par: Stein, David, et autres
Publié: (2026)

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
par: Tukan, Murad, et autres
Publié: (2024)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
par: Chen, Yixin, et autres
Publié: (2024)

Breaking Hard Isomorphism Benchmarks with DRESS
par: Velilla, Eduar Castrillo
Publié: (2026)

A 4-approximation algorithm for min max correlation clustering
par: Heidrich, Holger, et autres
Publié: (2023)

Total Variation Distance Meets Probabilistic Inference
par: Bhattacharyya, Arnab, et autres
Publié: (2023)

Are Graph Neural Networks Optimal Approximation Algorithms?
par: Yau, Morris, et autres
Publié: (2023)

The Computational Complexity of Positive Non-Clashing Teaching in Graphs
par: Ganian, Robert, et autres
Publié: (2025)

Learning to Prune Instances of Steiner Tree Problem in Graphs
par: Zhang, Jiwei, et autres
Publié: (2022)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
par: Abboud, Amir, et autres
Publié: (2025)

Online Graph Coloring for $k$-Colorable Graphs
par: Kawarabayashi, Ken-ichi, et autres
Publié: (2025)

Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
par: Zhang, Bohang, et autres
Publié: (2024)

Stability in Graphs with Matroid Constraints
par: Fomin, Fedor V., et autres
Publié: (2024)

Graph Visualization for Blockchain Data
par: Dietl, Marcell, et autres
Publié: (2024)

Temporal Graph Realization With Bounded Stretch
par: Mertzios, George B., et autres
Publié: (2025)

Distance-Preserving Graph Compression Techniques
par: Madani, Amirali, et autres
Publié: (2023)

Online Graph Balancing and the Power of Two Choices
par: Bansal, Nikhil, et autres
Publié: (2026)

Optimal Enumeration of Eulerian Trails in Directed Graphs
par: Bals, Ben, et autres
Publié: (2026)

Optimal Padded Decomposition For Bounded Treewidth Graphs
par: Filtser, Arnold, et autres
Publié: (2024)

FO and MSO Model Checking on Temporal Graphs
par: Döring, Michelle, et autres
Publié: (2026)

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

Exponential Time Approximation for Coloring 3-Colorable Graphs
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
par: Dahan, Anatole, et autres
Publié: (2026)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
par: Hamm, Thekla, et autres
Publié: (2022)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
par: Mömke, Tobias, et autres
Publié: (2024)

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2024)

Algorithmic Results for Weak Roman Domination Problem in Graphs
par: Paul, Kaustav, et autres
Publié: (2024)