Modular Decomposition-Based Graph Compression for Fast Reachability Detection
Abstract Fast reachability detection is one of the key problems in graph applications. Most of the existing works focus on creating an index and answering reachability based on that index. For these approaches, the index construction time and index size can become a concern for large graphs. More re...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2019-08-01
|
| Series: | Data Science and Engineering |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1007/s41019-019-00099-9 |