Copertina

Spectral Toolkit of Algorithms for Graphs: Technical Report (2)

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Macgregor, Peter, Sun, He
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Machine Learning Mathematical Software Social and Information Networks
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality
di: Li, Zihao, et al.
Pubblicazione: (2024)

On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models
di: Bhaskara, Aditya, et al.
Pubblicazione: (2024)

Provably Extending PageRank-based Local Clustering Algorithm to Weighted Directed Graphs with Self-Loops and to Hypergraphs
di: Li, Zihao, et al.
Pubblicazione: (2024)

Coreset Spectral Clustering
di: Jourdan, Ben, et al.
Pubblicazione: (2025)

inGRASS: Incremental Graph Spectral Sparsification via Low-Resistance-Diameter Decomposition
di: Aghdaei, Ali, et al.
Pubblicazione: (2024)

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

A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time
di: Shen, Ranran, et al.
Pubblicazione: (2023)

Spectral Triadic Decompositions of Real-World Networks
di: Basu, Sabyasachi, et al.
Pubblicazione: (2022)

Weighted Embeddings for Low-Dimensional Graph Representation
di: Bläsius, Thomas, et al.
Pubblicazione: (2024)

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

Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model
di: Feng, Weiming, et al.
Pubblicazione: (2025)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
di: Basu, Sabyasachi, et al.
Pubblicazione: (2024)

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution
di: Li, Songhua, et al.
Pubblicazione: (2023)

Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
di: Balmaseda, Vicente, et al.
Pubblicazione: (2024)

Learn to Vaccinate: Combining Structure Learning and Effective Vaccination for Epidemic and Outbreak Control
di: Elahi, Sepehr, et al.
Pubblicazione: (2025)

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions
di: Venturin, Giorgio, et al.
Pubblicazione: (2025)

Revisiting Information Cascades in Online Social Networks
di: Sidorov, Michael, et al.
Pubblicazione: (2022)

Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity
di: Oettershagen, Lutz, et al.
Pubblicazione: (2025)

On the External Validity of Average-Case Analyses of Graph Algorithms
di: Bläsius, Thomas, et al.
Pubblicazione: (2022)

Differential Privacy on Trust Graphs
di: Ghazi, Badih, et al.
Pubblicazione: (2024)

A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
di: You, Fangchen
Pubblicazione: (2025)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
di: Davot, Tom, et al.
Pubblicazione: (2024)

Computing Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs
di: Vombatkere, Karan, et al.
Pubblicazione: (2026)

Aggregating maximal cliques in real-world graphs
di: Alon, Noga, et al.
Pubblicazione: (2025)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
di: Huang, Yufan, et al.
Pubblicazione: (2023)

A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation
di: Hashemi, Mohammad, et al.
Pubblicazione: (2024)

A Fully-dynamic Approximation Algorithm for Maximum Weight b-Matchings in Graphs
di: Brandt-Tumescheit, Fabian, et al.
Pubblicazione: (2024)

Spectral clustering in the Gaussian mixture block model
di: Li, Shuangping, et al.
Pubblicazione: (2023)

Dynamic DBSCAN with Euler Tour Sequences
di: Shin, Seiyun, et al.
Pubblicazione: (2025)

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

Node Similarities under Random Projections: Limits and Pathological Cases
di: Tadić, Tvrtko, et al.
Pubblicazione: (2024)

HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property
di: Chen, Zixuan, et al.
Pubblicazione: (2023)

Fast multiplication by two's complement addition of numbers represented as a set of polynomial radix 2 indexes, stored as an integer list for massively parallel computation
di: Stocks, Mark
Pubblicazione: (2023)

Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime
di: Jourdan, Ben, et al.
Pubblicazione: (2024)

Efficient Graph Matching for Correlated Stochastic Block Models
di: Chai, Shuwen, et al.
Pubblicazione: (2024)

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

A New Initial Approximation Bound in the Durand Kerner Algorithm for Finding Polynomial Zeros
di: Sanjoyo, B. A., et al.
Pubblicazione: (2025)

Graph Discovery and Source Detection in Temporal Graphs
di: Bals, Ben
Pubblicazione: (2025)

An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs
di: Han, Seongjune, et al.
Pubblicazione: (2026)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
di: Chen, Jingbang, et al.
Pubblicazione: (2024)