Core decomposition, maintenance and applications

DOI10.1007/978-3-030-41672-0_12MaRDI QIDQ3297830zbMATH OpenOpenAlexFDO

Authors Feiteng Zhang, Bin Liu, Qizhi Fang

Publication date 20 July 2020

Published in Complexity and Approximation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-41672-0_12

zbMATH Keywords

\(k\)-corecore decompositioncore maintenance

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Social networks; opinion dynamics (91D30)

Recommendations

• Fast algorithms for determining (generalized) core groups in social networks
• Cores and shells of graphs.
• An order approach for the core maintenance problem on edge-weighted graphs
• Efficient temporal core maintenance of massive graphs
• Generalized core maintenance of dynamic bipartite graphs

Cites work

• A k-shell decomposition method for weighted networks
• Efficient and effective community search
• Fast algorithms for determining (generalized) core groups in social networks
• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• Listing all maximal cliques in sparse graphs in near-optimal time
• On the chance-constrained minimum spanning \(k\)-core problem

Cited in

(14)

• Cohesive subgraph computation over large sparse graphs. Algorithms, data structures, and programming techniques
• Fast algorithms for determining (generalized) core groups in social networks
• Efficient temporal core maintenance of massive graphs
• Order based algorithms for the core maintenance problem on edge-weighted graphs
• Cliques in regular graphs and the core-periphery problem in social networks
• Unfolding the core structure of the reciprocal graph of a massive online social network
• The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures
• Distributed core decomposition in probabilistic graphs
• Cohesive subgraph search over large heterogeneous information networks
• Statistical models for cores decomposition of an undirected random graph
• Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs
• Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications
• Targeted \(k\)-node collapse problem: towards understanding the robustness of local \(k\)-core structure
• Hardness of dynamic core and truss decompositions

This page was built for publication: Core decomposition, maintenance and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297830)