Get started
Keyword

graph exploration

Description: Graph exploration is the systematic traversal or investigation of a graph to discover its vertices, edges, or structure, studied in algorithms and robotics.
OpenAlex ID: keywords/graph-exploration
Ant Colony Optimization
2011 · Ranjith Kumar A, Ranjith Kumar R · 1,225
Trinity
2013 · Bin Shao, Haixun Wang, et al. · Proceedings - ACM-SIGMOD International Conference on Management of Data · 432
Exploring Unknown Environments
1997 · Susanne Albers, Monika R. Henzinger · SIAM Journal on Computing · 317
PDF
Scalable Graph Exploration on Multicore Processors
2010 · Virat Agarwal, Fabrizio Petrini, et al. · 224
The power of a pebble
1998 · Michael A. Bender, Antonio Fernández, et al. · 224
GUESS
2006 · Eytan Adar · ACM SIGCHI Conference on Human Factors in Computing Systems (CHI) · 207
Algorithms - ESA 2003
2003 · Cheong, Otfried, Goaoc, Xavier, et al. · Lecture notes in computer science · 198
Exploring Unknown Undirected Graphs
1999 · Petrişor Panaite, Andrzej Pelc · Journal of Algorithms · 193
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
2008 · Chen Avin, Michal Koucký, et al. · Lecture notes in computer science · 191
A tight lower bound on the cover time for random walks on graphs
1995 · Uriel Feige · Random Structures and Algorithms · 189
Graph exploration by a finite automaton
2005 · Pierre Fraigniaud, David Ilcinkas, et al. · Theoretical Computer Science · 185
Exploring an unknown graph
1999 · Xiaotie Deng, Christos H. Papadimitriou · Journal of Graph Theory · 146
Learning with Partially Absorbing Random Walks
2012 · Xiao-Ming Wu, Zhenguo Li, et al. · 124
Exploring an unknown graph
1999 · Xiaotie Deng, Christos H. Papadimitriou · Journal of Graph Theory · 119
Exploring an unknown graph
2002 · X. Deng, C.H. Papadimitriou · Annual Symposium on Foundations of Computer Science · 115
Traveling salesman problems in temporal graphs
2016 · Othon Michail, Paul G. Spirakis · Theoretical Computer Science · 114
PDF
A natural extension to the convex hull problem and a novel solution
2017 · Ajwani, Deepak, Bisseling, Rob H., et al. · arXiv (Cornell University) · 112
PDF
Deterministic rendezvous in networks: A comprehensive survey
2012 · Andrzej Pelc · Networks · 110
A Distributed Ant Algorithm for\protect Efficiently Patrolling a Network
2003 · Vladimir Yanovski, Israel A. Wagner, et al. · Algorithmica · 106
The Power of a Pebble: Exploring and Mapping Directed Graphs
2002 · Michael A. Bender, Antonio Fernández, et al. · Information and Computation · 103
How to meet when you forget: log-space rendezvous in arbitrary graphs
2011 · Jurek Czyzowicz, Adrian Kosowski, et al. · Distributed Computing · 101
External-Memory Breadth-First Search with Sublinear I/O
2002 · Kurt Mehlhorn, Ulrich Meyer · Lecture notes in computer science · 101
Multirobot Tree and Graph Exploration
2011 · Peter Brass, Flavio Cabrera-Mora, et al. · IEEE Transactions on Robotics · 100
RapidMatch
2020 · Shixuan Sun, Xibo Sun, et al. · Proceedings of the VLDB Endowment · 97
Label-guided graph exploration by a finite automaton
2008 · Reuven Cohen, Pierre Fraigniaud, et al. · ACM Transactions on Algorithms · 95
Works count: 754
Citation count: 11,080
Year
Topic
Type