BiRch:a bidirectional search algorithm for k-step reachability queries
A new bidirectional processing algorithm,namely BiRch was proposed.When checking whether a vertex u can reach v within k steps,BiRch firstly compared the out-degree of u and the in-degree of v,and processed the one with smaller degree,such that to avoid large indexes and the inefficiency due to larg...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2015-08-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/thesisDetails#10.11959/j.issn.1000-436x.2015230 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|