Why WormHole Could Be the Future of Fast Graph Queries
Table of Links Abstract and 1. Introduction 1.1 Our Contribution 1.2 Setting 1.3 The algorithm Related Work Algorithm 3.1 The Structural Decomposition Phase 3.2 The Routing Phase 3.3 Variants of WormHole Theoretical Analysis 4.1 Preliminaries 4.2 Sublinearity of Inner Ring 4.3 Approximation Error 4.4 Query Complexity Experimental Results 5.1 WormHole𝐸, WormHole𝐻 and BiBFS 5.2 Comparison … Read more