Characterization of Graphs Using Degree Cores

DOI10.1007/978-3-540-78808-9_13zbMath1142.68313OpenAlexW2174092017MaRDI QIDQ3520038

No author found.

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)

Related Items (2)

Knowledge cores in large formal contexts ⋮ Tree decompositions and social graphs

Cites Work

• Unnamed Item
• Unnamed Item
• \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
• The degree sequence of a scale-free random graph process
• Emergence of Scaling in Random Networks
• Coupling Online and Offline Analyses for Random Power Law Graphs
• The elements of statistical learning. Data mining, inference, and prediction

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