reachability : Related Words Words similar in meaning to reachability
- reachable«
- vertex«
- graph«
- node«
- reachability query«
- reachability relation«
- separator«
- dipaths«
- algorithm«
- dipath«
- pair«
- layer«
- adjacency«
- vertex failure«
- traversal«
- connected component«
- linear time«
- recursion«
- consecutive layer«
- shortest path distance«
- edge«
- planarity«
- query«
- transitive closure«
- method«
- previous step«
- path«
- undirected graph«
- time«
- data structure«
- warshall algorithm«
- vertex store«
- separator phase«
- separator path«
- planar digraph«
- pairwise reachability«
- natural indexing«
- logarithmic time query«
- logarithmic recursion depth«
- first traversal«
- efficient oracle«
- component«
- t. kameda«
- iterative deepening depth«
- edge failure«
- approach partition«
- noteworthy consequence«
- breadth«
- reachability relationship«
- relevant concern«
- logarithmic depth«
- vertex reachable«
- step«
- mikkel thorup«
- specialized situation«
- transitive reduction«
- arbitrary vertex«
- thorup«
- edge crossing«
- exact choice«
- performance concern«
- planar separator theorem«
- floyd–warshall algorithm«
- extra storage space«
- negative cycle«
- query time«
- running application«
- incident edge«
- complex data structure«
- search technique«
- acyclic«
- faster method«
- set«
- tarjan«
- adjacent layer«
- kameda«
- original graph«
- route information«
- cycle«
- single vertex«
- extra bit«
- adjacent vertex«
- sequence«
- sophisticated method«
- preorder«
- extra information«
- definition«
- depth«
- planar graph«
- lipton«
- main result«
- approximate«
- label«
- shortest path«
- previous level«
- garbage collection«
- additional property«
- search«
- layering«
- embedding«
- planar«
- original paper«
- symmetric«
- nature«
- graph theory«
- floyd«
- size«
- reclamation«
- property«
- additional information«
- connectivity«
- total«
- contraction«
- stack«
- problem«
- 2-dimensional label«
- 0-outdegree vertex«
- 0-indegree vertex«
