Cover Image

Local dominance unveils clusters in networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shi, Dingyi, Shang, Fan, Chen, Bingsheng, Expert, Paul, Lü, Linyuan, Stanley, H. Eugene, Lambiotte, Renaud, Evans, Tim S., Li, Ruiqi
Format:	Preprint
Published:	2022
Subjects:	Physics and Society Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search
by: Brous, Daniel, et al.
Published: (2025)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

Liar's vertex-edge domination in unit disk graph
by: Bhattacharya, Debojyoti, et al.
Published: (2025)

Algorithmic study on liar's vertex-edge domination problem
by: Bhattacharya, Debojyoti, et al.
Published: (2023)

Liar's vertex-edge domination in subclasses of chordal graphs
by: Bhattacharya, Debojyoti, et al.
Published: (2025)

Balanced Spanning Tree Distributions Have Separation Fairness
by: Chen, Harry, et al.
Published: (2025)

Ranking with Partitioning
by: Boardman, Samuel
Published: (2026)

Construction and Preliminary Validation of a Dynamic Programming Concept Inventory
by: Ferland, Matthew, et al.
Published: (2024)

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

K-stars LDP: A Novel Framework for (p, q)-clique Enumeration under Local Differential Privacy
by: Sun, Henan, et al.
Published: (2024)

Chromatic correlation clustering via cluster LP
by: Abbasi, Fateme, et al.
Published: (2025)

Pivot based correlation clustering in the presence of good clusters
by: Lolck, David Rasmussen, et al.
Published: (2026)

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
by: Kobayashi, Yasuaki, et al.
Published: (2023)

The clustered Sparrow algorithm
by: Dumitrescu, Cristian
Published: (2018)

Local Search for Clustering in Almost-linear Time
by: Jiang, Shaofeng H. -C., et al.
Published: (2025)

Explaining Rankings with Hidden Group Bonuses
by: Yan, Alvin Hong Yao, et al.
Published: (2026)

On the power of standard DFS and BFS
by: Bui-Xuan, Binh-Minh, et al.
Published: (2026)

Dynamic k-center clustering with lifetimes
by: Moretti, Simone, et al.
Published: (2026)

SPARSE-PIVOT: Dynamic correlation clustering for node insertions
by: Dalirrooyfard, Mina, et al.
Published: (2025)

Dependent randomized rounding for clustering and partition systems with knapsack constraints
by: Harris, David G., et al.
Published: (2017)

ShiftDTW: adapting the DTW metric for cyclic time series clustering
by: Foulon, Lucas, et al.
Published: (2024)

A greedy approach for increased vehicle utilization in ridesharing networks
by: Makhdomi, Aqsa Ashraf, et al.
Published: (2023)

Node ranking in labeled networks
by: Arachchi, Chamalee Wickrama, et al.
Published: (2025)

Maximum Biclique for Star 1,2,3 -free and Bounded Bimodularwidth Twin-free Bipartite Graphs $\star$
by: de Montgolfier, Fabien, et al.
Published: (2025)

Approximating $δ$-Covering
by: Hartmann, Tim A., et al.
Published: (2024)

Locally Rainbow Paths
by: Fluschnik, Till, et al.
Published: (2024)

Cactus Representation of Minimum Cuts: Derandomize and Speed up
by: He, Zhongtian, et al.
Published: (2024)

Locally computing edge orientations
by: Mitrović, Slobodan, et al.
Published: (2025)

When Local and Non-Local Meet: Quadratic Improvement for Edge Estimation with Independent Set Queries
by: Adar, Tomer, et al.
Published: (2026)

Improved fixed-parameter bounds for Min-Sum-Radii and Diameters $k$-clustering and their fair variants
by: Banerjee, Sandip, et al.
Published: (2025)

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
by: Biedl, Therese
Published: (2025)

Optimal FIFO grouping in public transit networks
by: Steil, Patrick
Published: (2023)

Dynamic Construction of the Lovász Local Lemma
by: Haeupler, Bernhard, et al.
Published: (2026)

Estimating Hitting Times Locally At Scale
by: Haris, Themistoklis, et al.
Published: (2025)

Local Search k-means++ with Foresight
by: Conrads, Theo, et al.
Published: (2024)

Local Max-Cut on Sparse Graphs
by: Schwartzman, Gregory
Published: (2023)

One-Sided Local Crossing Minimization
by: Giannopoulos, Panos, et al.
Published: (2025)

The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions
by: McWhorter, Atticus, et al.
Published: (2025)

Fairness in Streaming Submodular Maximization over a Matroid Constraint
by: Halabi, Marwa El, et al.
Published: (2023)

Differentially Private Release of Israel's National Registry of Live Births
by: Hod, Shlomi, et al.
Published: (2024)