Core Decomposition of Massive, Information-Rich Graphs
- Francesco BonchiAffiliated withISI Foundation Email author
- , Francesco GulloAffiliated withUniCredit, R&D Dept
- , Andreas KaltenbrunnerAffiliated withEurecat
- Core decomposition
The set of all k-cores of a graph, for all k.
- Core number (or core index)
For each vertex of a graph, the highest order of a core containing that vertex.
The highest order of a core of a graph. It corresponds to the maximum core number over all vertices of the graph.
- Distributed graph
Graph that is stored across multiple machines.
- Graph (or network)
A set of objects (called vertices or nodes) connected to each other by links (also known as edges or arcs). Links can be represented as unordered or ordered pairs of vertices. In the former case, the graph is said to be undirected, otherwise it is directed. Links may be assigned weights. In this case, the graph is said weighted.
- k-core (or core of order k)
Maximal subgraph where each vertex is connected to at least k other vertices within the subgraph.
Subgraph induced by all vertices belonging to the k-core but ...
Reference Work Entry Metrics
Date: 2017 (Latest)History
- 2017 (Latest)
- Core Decomposition of Massive, Information-Rich Graphs
- Reference Work Title
- Encyclopedia of Social Network Analysis and Mining
- pp 1-11
- Print ISBN
- Online ISBN
- Springer New York
- Copyright Holder
- Springer Science+Business Media LLC
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 1. Computer Science, University of Calgary
- 2. University of Calgary Computer Science
- Author Affiliations
- 3. ISI Foundation, Turin, Italy
- 4. UniCredit, R&D Dept, Rome, Italy
- 5. Eurecat, Barcelona, Spain
To view the rest of this content please follow the download PDF link above.