A Fast Order-Based Approach for Core Maintenance

@article{Zhang2016AFO,
  title={A Fast Order-Based Approach for Core Maintenance},
  author={Yikai Zhang and Jeffrey Xu Yu and Y. Zhang and Lu Qin},
  journal={2017 IEEE 33rd International Conference on Data Engineering (ICDE)},
  year={2016},
  pages={337-348}
}
  • Yikai ZhangJ. Yu Lu Qin
  • Published 1 June 2016
  • Computer Science
  • 2017 IEEE 33rd International Conference on Data Engineering (ICDE)
Graphs have been widely used in many applications such as social networks, collaboration networks, and biological networks. One important graph analytics is to explore cohesive subgraphs in a large graph. Among several cohesive subgraphs studied, k-core is one that can be computed in linear time for a static graph. Since graphs are evolving in real applications, in this paper, we study core maintenance which is to reduce the computational cost to compute k-cores for a graph when graphs are… 

Simplified Algorithms for Order-Based Core Maintenance

This work proposes a simplified orderbased approach by introducing the classical Order Data Structure to maintain the k-order, which significantly improves the worst-case time complexity for both edge insertion and removal algorithms.

Efficient Distributed Approaches to Core Maintenance on Large Dynamic Graphs

A distributed batch-stream combined algorithm (DBCA) is devised to efficiently maintain the core numbers when vertex/edge updates happen, and a new task assignment strategy is introduced to DBCA based on diversity of the edge-cores of updated edges.

Parallel Order-Based Core Maintenance in Dynamic Graphs

A new parallel core maintenance algorithm based on the Order algorithm is proposed, which achieves up to 289x and 10x times speedups compared with the most efficient existing method, respectively.

Hierarchical Core Maintenance on Large Dynamic Graphs

In this paper, in-depth analyses on the structural properties of the hierarchy are conducted, and well-designed local update techniques are proposed that significantly outperform the baselines on runtime by up to 3 orders of magnitude.

Generalized core maintenance of dynamic bipartite graphs

This work presents a bottom-up approach for efficiently maintaining all (i, j)-cores, from sparse to dense and a top-down approach to maintain ( i, j-cores from dense to sparse.

Batch dynamic algorithm to find k-core hierarchies

A new dynamic batch algorithm to maintain cores, with their connected subgraphs, that improves efficiency over processing edge-by-edge while remaining under re-computing from scratch is developed.

Shared-Memory Scalable k-Core Maintenance on Dynamic Graphs and Hypergraphs

This work presents two parallel and scalable fully-dynamic batch algorithms for maintaining k-cores on both graphs and hypergraphs, and provides the first algorithms that experimentally demonstrate scalability as the number of threads increase while sustaining high change rates in graphs andhypergraphs.

Batch Dynamic Algorithm to Find k-Cores and Hierarchies

A novel dynamic batch algorithm to maintain the Shell Tree Index is developed that improves efficiency over processing edge-by-edge and can be returned on rapidly changing graphs quickly enough for interactive applications.

On Querying Historical K-Cores

This paper proposes an index-based solution and several pruning strategies to reduce the index size, and designs a novel algorithm to construct this index, whose running time is linear to the final index size.
...

References

SHOWING 1-10 OF 20 REFERENCES

Incremental k-core decomposition: algorithms and evaluation

This paper proposes a suite of incremental k-core decomposition algorithms for dynamic graph data, and presents incremental algorithms for both insertion and deletion operations, and proposes auxiliary vertex state maintenance techniques that can further accelerate these operations.

Streaming Algorithms for k-core Decomposition

This paper proposes the first incremental k-core decomposition algorithms for streaming graph data, which locate a small subgraph that is guaranteed to contain the list of vertices whose maximum k-Core values have to be updated, and efficiently process this subgraph to update the k- core decomposition.

Efficient core decomposition in massive networks

This paper proposes the first external-memory algorithm for core decomposition in massive graphs and demonstrates the efficiency of the algorithm on real networks with up to 52.9 million vertices and 1.65 billion edges.

Incremental graph pattern matching

Investigating incremental algorithms for graph pattern matching defined in terms of graph simulation, bounded simulation and subgraph isomorphism shows that the incremental matching problem is unbounded, i.e., its cost is not determined by the size of the changes alone, and demonstrates that the problem is intractable and unbounded for unit updates and path patterns.

Reachability queries on large dynamic graphs: a total order approach

This paper introduces a general indexing framework that summarizes a family of reachability indices with the best performance among the existing techniques for static graphs, and proposes general and efficient algorithms for handling vertex insertions and deletions under this framework.

I/O efficient Core Graph Decomposition at web scale

This paper proposes a semi-external algorithm and two optimized algorithms for I/O efficient core decomposition using very simple structures and data access model, and is the first to handle a web graph with 978.5 million nodes and 42.6 billion edges using less than 4.2 GB memory.

K-Core Decomposition of Large Networks on a Single PC

A thorough analysis of all algorithms concluding that it is viable to compute k-core decomposition for large networks in a consumer-grade PC and an optimized implementation of an external-memory algorithm by Cheng, Ke, Chu, and Ozsu is presented.

Efficient Densest Subgraph Computation in Evolving Graphs

This work studies the densest subgraph problem in the the dynamic graph model, for which it is presented the first scalable algorithm with provable guarantees, and shows that (approximate) densmost subgraphs can be maintained efficiently within hundred of microseconds per update.

Truss Decomposition in Massive Networks

This work improves the existing in-memory algorithm for computing k-truss in networks of moderate size and proposes two I/O-efficient algorithms to handle massive networks that cannot fit in main memory.

Using the k-core decomposition to analyze the static structure of large-scale software systems

The software graph is visualize and the k-core analysis is used to study software structure based on a recursive pruning of the least connected vertices, suggesting that software is organized in a defined hierarchy of increasing centrality from outside to inside.