Characterization of Graphs Using Degree Cores

DOI10.1007/978-3-540-78808-9_13MaRDI QIDQ3520038zbMATH OpenOpenAlexFDO

Authors

Publication date 19 August 2008

Published in Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78808-9_13

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Statistical models for cores decomposition of an undirected random graph
• A Scalable Generative Graph Model with Community Structure
• scientific article; zbMATH DE number 5994660
• Sparse networks with core-periphery structure
• Kronecker graphs: an approach to modeling networks

Cites work

• \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
• Coupling Online and Offline Analyses for Random Power Law Graphs
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 2084315 (Why is no real title available?)
• scientific article; zbMATH DE number 3173143 (Why is no real title available?)
• The degree sequence of a scale-free random graph process
• The elements of statistical learning. Data mining, inference, and prediction

Cited in

(8)

• Knowledge cores in large formal contexts
• Classifying character degree graphs with six vertices
• scientific article; zbMATH DE number 434696 (Why is no real title available?)
• Core and Conditional Core Path of Specified Length in Special Classes of Graphs
• Statistical models for cores decomposition of an undirected random graph
• Tree decompositions and social graphs
• Augmenting \(k\)-core generation with preferential attachment
• Standardization of perspectives into degree-splitting graph of a graph

This page was built for publication: Characterization of Graphs Using Degree Cores

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