Copertina

Bonsai: A class of effective methods for independent sampling of graph partitions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Clelland, Jeanne, Tapp, Kristopher
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms Computers and Society Social and Information Networks
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Parallel Algorithms for Median Consensus Clustering in Complex Networks
di: Hussain, Md Taufique, et al.
Pubblicazione: (2024)

Persistent Homology generalizations for Social Media Network Analysis
di: Rocha, Isabela
Pubblicazione: (2024)

Finding coherent node groups in directed graphs
di: Kumpulainen, Iiro, et al.
Pubblicazione: (2023)

BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs
di: Baudin, Alexis, et al.
Pubblicazione: (2024)

Spectral partitioning of graphs into compact, connected regions
di: Davies, Ewan, et al.
Pubblicazione: (2025)

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

A novel DFS/BFS approach towards link prediction
di: Dörpinghaus, Jens, et al.
Pubblicazione: (2024)

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

Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention
di: Tong, Gunagmo, et al.
Pubblicazione: (2019)

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

The Theory and Practice of Computing the Bus-Factor
di: Piccolo, Sebastiano A., et al.
Pubblicazione: (2026)

Counting Graphlets of Size $k$ under Local Differential Privacy
di: Suppakitpaisarn, Vorapong, et al.
Pubblicazione: (2025)

Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs
di: Nakamura, Kengo, et al.
Pubblicazione: (2026)

Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
di: Zhou, Alexander, et al.
Pubblicazione: (2026)

Profit Maximization in Closed Social Networks
di: Sharma, Poonam, et al.
Pubblicazione: (2026)

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

Density Decomposition on Hypergraphs
di: Leng, Xiaoyu, et al.
Pubblicazione: (2026)

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

Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
di: Srivastava, Ajitesh, et al.
Pubblicazione: (2024)

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
di: Zheng, Dehong, et al.
Pubblicazione: (2025)

Multilevel Digital Contact Tracing
di: Mahapatra, Gautam, et al.
Pubblicazione: (2020)

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

An Edge-Based Decomposition Framework for Temporal Networks
di: Oettershagen, Lutz, et al.
Pubblicazione: (2023)

Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
di: Chang, Lijun
Pubblicazione: (2024)

Inferring Tie Strength in Temporal Networks
di: Oettershagen, Lutz, et al.
Pubblicazione: (2022)

Fast Approximate CoSimRanks via Random Projections
di: Yang, Renchi, et al.
Pubblicazione: (2020)

Temporal Betweenness Centrality on Shortest Walks Variants
di: Naima, Mehdi
Pubblicazione: (2023)

Fast Percolation Centrality Approximation with Importance Sampling
di: Cruciani, Antonio, et al.
Pubblicazione: (2025)

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
di: Lu, Qiheng, et al.
Pubblicazione: (2025)

Catch Me If You Can: Finding the Source of Infections in Temporal Networks
di: Bals, Ben, et al.
Pubblicazione: (2024)

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

Fast Estimation of Percolation Centrality
di: Cruciani, Antonio
Pubblicazione: (2024)

Equalizing Closeness Centralities via Edge Additions
di: Crane, Alex, et al.
Pubblicazione: (2025)

An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
di: Spaeh, Fabian, et al.
Pubblicazione: (2025)

Efficient Sampling of Temporal Networks with Preserved Causality Structure
di: Stamm, Felix I., et al.
Pubblicazione: (2025)

Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models
di: Bishnu, Arijit, et al.
Pubblicazione: (2025)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
di: Bläsius, Thomas, et al.
Pubblicazione: (2024)

On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis
di: Lu, Qiheng, et al.
Pubblicazione: (2024)

Opinion Maximization in Social Networks by Modifying Internal Opinions
di: Wang, Gengyu, et al.
Pubblicazione: (2025)

Locally Differentially Private Graph Clustering via the Power Iteration Method
di: Suppakitpaisarn, Vorapong, et al.
Pubblicazione: (2025)