Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
graph reachability
Description:
The property of whether a path exists between vertices in a graph, studied in graph theory, algorithms, and program analysis.
Related topics:
Complexity and Algorithms in Graphs (16%),
Graph Theory and Algorithms (13%),
Logic, programming, and type systems (12%),
Advanced Graph Theory Research (8%)
Wikidata ID:
wiki/Q1361526
OpenAlex ID:
keywords/graph-reachability
Precise interprocedural dataflow analysis via graph reachability
1995
·
Thomas Reps
, Susan Horwitz
, et al.
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
1,392
Program analysis via graph reachability
1998
·
Thomas Reps
·
Information and Software Technology
·
404
ReasoNet: Learning to Stop Reading in Machine Comprehension
2017
·
Yelong Shen
, Po-Sen Huang
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
301
PDF
Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks.
2004
·
R.J. Gutman
·
292
Dual Labeling: Answering Graph Reachability Queries in Constant Time
2006
·
Haixun Wang
, Hao He
, et al.
·
IEEE International Conference on Data Engineering (ICDE)
·
275
Static Control-Flow Analysis of User-Driven Callbacks in Android Applications
2015
·
Shengqian Yang
, Dacong Yan
, et al.
·
ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)
·
200
Static memory leak detection using full-sparse value-flow analysis
2012
·
Yulei Sui
, Ding Ye
, et al.
·
International Symposium on Software Testing and Analysis
·
198
Detecting Memory Leaks Statically with Full-Sparse Value-Flow Analysis
2014
·
Yulei Sui
, Ding Ye
, et al.
·
IEEE Transactions on Software Engineering
·
156
Undecidability of context-sensitive data-dependence analysis
2000
·
Thomas Reps
·
ACM Transactions on Programming Languages and Systems
·
149
PDF
An Efficient Algorithm for Answering Graph Reachability Queries
2008
·
Yangjun Chen
, Yibin Chen
·
IEEE International Conference on Data Engineering (ICDE)
·
144
HyperANF: approximating the neighbourhood function of very large graphs on a budget
2011
·
Paolo Boldi
, Marco Rosa
, et al.
·
International World Wide Web Conference (WWW)
·
142
FERRARI: Flexible and efficient reachability range assignment for graph indexing
2013
·
S. Seufert
, A. Anand
, et al.
·
IEEE International Conference on Data Engineering (ICDE)
·
139
Reachability is harder for directed than for undirected finite graphs
1990
·
Miklos Ajtai
, Ronald Fagin
·
Journal of Symbolic Logic
·
138
Studying Recommendation Algorithms by Graph Analysis
2003
·
Batul J. Mirza
, Benjamin J. Keller
, et al.
·
Journal of Intelligent Information Systems
·
135
On-demand strong update analysis via value-flow refinement
2016
·
Yulei Sui
, Jingling Xue
·
ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE)
·
113
The set constraint/CFL reachability connection in practice
2004
·
John Kodumal
, Alex Aiken
·
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
·
99
PDF
Simple, fast, and scalable reachability oracle
2013
·
Ruoming Jin
, Guan Wang
·
Proceedings of the VLDB Endowment
·
84
PDF
Directed Planar Reachability Is in Unambiguous Log-Space
2009
·
Chris Bourke
, Raghunath Tewari
, et al.
·
ACM Transactions on Computation Theory
·
74
Program synthesis by type-guided abstraction refinement
2019
·
Zheng Guo
, Michael James
, et al.
·
Proceedings of the ACM on Programming Languages
·
73
On-line computation of transitive closures of graphs
1983
·
T. Ibaraki
, N. Katoh
·
Information Processing Letters
·
70
Value-Flow-Based Demand-Driven Pointer Analysis for C and C++
2018
·
Yulei Sui
, Jingling Xue
·
IEEE Transactions on Software Engineering
·
63
Program Analysis via Graph Reachability
1997
·
Thomas Reps
·
The MIT Press eBooks
·
60
Path-hop: efficiently indexing large graphs for reachability queries
2010
·
Jing Cai
, Chung Keung Poon
·
ACM International Conference on Information and Knowledge Management (CIKM)
·
58
Context-sensitive data-dependence analysis via linear conjunctive language reachability
2016
·
Qirun Zhang
, Zhendong Su
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
56
Planar and Grid Graph Reachability Problems
2009
·
Eric Allender
, David A. Mix Barrington
, et al.
·
Theory of Computing Systems
·
53
Show more works
View as search
Works count:
334
Citation count:
6,561
Year
Topic
Type