Fast algorithms for determining (generalized) core groups in social networks
From MaRDI portal
Publication:2442801
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Partitions of sets (05A18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cites work
- scientific article; zbMATH DE number 2084315 (Why is no real title available?)
- scientific article; zbMATH DE number 1168330 (Why is no real title available?)
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Asymptotic normality of the \(k\)-core in random graphs
- \(k\)-core architecture and \(k\)-core percolation on complex networks
- \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
Cited in
(41)- A parameterized complexity view on collapsing \(k\)-cores
- Practical minimum cut algorithms
- Parsimonious formulations for low-diameter clusters
- Restricted bi-pattern mining
- The weak core and the structure of elites in social multiplex networks
- The maximum clique interdiction problem
- An efficient exact algorithm for triangle listing in large graphs
- Percolation on complex networks: theory and application
- Unfolding the core structure of the reciprocal graph of a massive online social network
- Parallel maximum clique algorithms with applications to network analysis
- Predicting epidemic threshold in complex networks by graph neural network
- The k-Dense Method to Extract Communities from Complex Networks
- A \(k\)-shell decomposition method for weighted networks
- Metanetworks of artificially evolved regulatory networks
- Efficient temporal core maintenance of massive graphs
- An order approach for the core maintenance problem on edge-weighted graphs
- Efficient algorithms for finding diversified top-\(k\) structural hole spanners in social networks
- Detecting strong cliques in co-authorship networks
- OCSM: finding overlapping cohesive subgraphs with minimum degree
- Distributed core decomposition in probabilistic graphs
- Random networks are heterogeneous exhibiting a multi-scaling law
- Bounds and algorithms for graph trusses
- Network analysis of Zentralblatt MATH data
- Space efficient linear time algorithms for BFS, DFS and applications
- Efficient search for informational cores in complex systems: application to brain networks
- Degree sequences of monocore graphs
- Graph kernels: a survey
- Density decompositions of networks
- A family of pairwise multi-marginal optimal transports that define a generalized metric
- Core-satellite graphs: clustering, assortativity and spectral properties
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- Tree decompositions and social graphs
- Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications
- Efficient and effective community search
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Experiments on \(F\)-restricted bi-pattern mining
- Incremental problems in the parameterized complexity setting
- Core decomposition, maintenance and applications
- Discovering subjectively interesting multigraph patterns
- A parallel maximum clique algorithm for large and massive sparse graphs
- Statistical models for cores decomposition of an undirected random graph
This page was built for publication: Fast algorithms for determining (generalized) core groups in social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442801)
