:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Yang, Yichun, Li, Rong-Hua, Liao, Meihao, Lin, Longlong, Wang, Guoren
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2412.10789
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved Algorithms for Effective Resistance Computation on Graphs
por: Yang, Yichun, et al.
Publicado: (2025)

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

Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
por: Li, Cheng, et al.
Publicado: (2025)

BD-Index: Scalable Biharmonic Distance Queries on Large Graphs via Divide-and-Conquer Indexing
por: Pan, Yueyang, et al.
Publicado: (2025)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
por: Ye, Xiaowei, et al.
Publicado: (2024)

Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs
por: Yang, Yichun, et al.
Publicado: (2026)

Scalable Similarity Search over Large Attributed Bipartite Graphs
por: Ou, Xi, et al.
Publicado: (2025)

An Approximation Algorithm for Graph Label Selection
por: John, Josia, et al.
Publicado: (2026)

Improved Approximations for Hard Graph Problems using Predictions
por: Aamand, Anders, et al.
Publicado: (2025)

Sharper Bounds for Chebyshev Moment Matching, with Applications
por: Musco, Cameron, et al.
Publicado: (2024)

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust
por: Chen, Hongjie, et al.
Publicado: (2024)

Query-Efficient Locally Private Hypothesis Selection via the Scheffe Graph
por: Kamath, Gautam, et al.
Publicado: (2025)

Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
por: Chen, Hongjie, et al.
Publicado: (2025)

Local Fragments, Global Gains: Subgraph Counting using Graph Neural Networks
por: Roy, Shubhajit, et al.
Publicado: (2023)

Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach
por: Shakiba, Ali
Publicado: (2023)

Adaptive Local Clustering over Attributed Graphs
por: Zheng, Haoran, et al.
Publicado: (2025)

Learning Augmented Graph $k$-Clustering
por: Fan, Chenglin, et al.
Publicado: (2025)

Incremental (k, z)-Clustering on Graphs
por: Cruciani, Emilio, et al.
Publicado: (2026)

Faster Graph Embeddings via Coarsening
por: Fahrbach, Matthew, et al.
Publicado: (2020)

Expander Hierarchies for Normalized Cuts on Graphs
por: Hanauer, Kathrin, et al.
Publicado: (2024)

GEFL: Extended Filtration Learning for Graph Classification
por: Zhang, Simon, et al.
Publicado: (2024)

Online Sparsification of Bipartite-Like Clusters in Graphs
por: Das, Joyentanuj, et al.
Publicado: (2025)

Distribution Learning Meets Graph Structure Sampling
por: Bhattacharyya, Arnab, et al.
Publicado: (2024)

Space of Data through the Lens of Multilevel Graph
por: Caputo, Marco, et al.
Publicado: (2025)

Rethinking Flexible Graph Similarity Computation: One-step Alignment with Global Guidance
por: Liu, Zhouyang, et al.
Publicado: (2025)

Dynamic Similarity Graph Construction with Kernel Density Estimation
por: Laenen, Steinar, et al.
Publicado: (2025)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
por: Esposito, Emmanuel, et al.
Publicado: (2022)

Exact Learning of Weighted Graphs Using Composite Queries
por: Goodrich, Michael T., et al.
Publicado: (2025)

DRESS: A Continuous Framework for Structural Graph Refinement
por: Velilla, Eduar Castrillo
Publicado: (2026)

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

Beyond Spectral Clustering: Probabilistic Cuts for Differentiable Graph Partitioning
por: Ghriss, Ayoub
Publicado: (2025)

Fast and Accurate Triangle Counting in Graph Streams Using Predictions
por: Boldrin, Cristian, et al.
Publicado: (2024)

Graph neural networks extrapolate out-of-distribution for shortest paths
por: Nerem, Robert R., et al.
Publicado: (2025)

Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts
por: Peng, Pan, et al.
Publicado: (2025)

Learning to Approximate Uniform Facility Location via Graph Neural Networks
por: Qian, Chendi, et al.
Publicado: (2026)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
por: Mishra, Nina, et al.
Publicado: (2025)

Scalable $k$-clique Densest Subgraph Search
por: Ye, Xiaowei, et al.
Publicado: (2024)

GPU Memory Usage Optimization for Backward Propagation in Deep Network Training
por: Hong, Ding-Yong, et al.
Publicado: (2025)

Graph Neural Network-Informed Predictive Flows for Faster Ford-Fulkerson and PAC-Learnability
por: Wiesler, Eleanor, et al.
Publicado: (2026)

Guessing Efficiently for Constrained Subspace Approximation
por: Bhaskara, Aditya, et al.
Publicado: (2025)