Artificial Intelligence
Constructing competitive tours from local information
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Piecemeal graph exploration by a mobile robot (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Online computation and competitive analysis
Online computation and competitive analysis
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Exploring unknown undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Programming Treatment of the Travelling Salesman Problem
Journal of the ACM (JACM)
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Dictionary of computer science engineering and technology
Dictionary of computer science engineering and technology
LAO: a heuristic search algorithm that finds solutions with loops
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
PHA*: performing A* in unknown physical environments
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A large database of graphs and its use for benchmarking graph isomorphism algorithms
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Algorithms for sequential decision-making
Algorithms for sequential decision-making
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
Web page classification without the web page
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Simulating the Webgraph: A Comparative Analysis of Models
Computing in Science and Engineering
Utility-based multi-agent system for performing repeated navigation tasks
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Graph Theory With Applications
Graph Theory With Applications
Fast webpage classification using URL features
Proceedings of the 14th ACM international conference on Information and knowledge management
Probabilistic Robotics (Intelligent Robotics and Autonomous Agents)
Probabilistic Robotics (Intelligent Robotics and Autonomous Agents)
Optimal constrained graph exploration
ACM Transactions on Algorithms (TALG)
Distributed navigation in an unknown physical environment
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments
Journal of Global Optimization
Fast periodic graph exploration with constant memory
Journal of Computer and System Sciences
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Proceedings of the VLDB Endowment
Reactive and dynamic local search for max-clique: Engineering effective building blocks
Computers and Operations Research
PHA*: finding the shortest path with A* in an unknown physical environment
Journal of Artificial Intelligence Research
Dynamic local search for the maximum clique problem
Journal of Artificial Intelligence Research
Real-time heuristic search with a priority queue
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Point-based value iteration: an anytime algorithm for POMDPs
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Deterministic POMDPs revisited
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Incremental pruning: a simple, fast, exact method for partially observable Markov decision processes
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Real-Time search algorithms for exploration and mapping
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Exploring an unknown graph efficiently
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A survey of models of the web graph
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
INTERNET TOPOLOGY DISCOVERY: A SURVEY
IEEE Communications Surveys & Tutorials
The Symposium on Combinatorial Search
AI Communications - The Symposium on Combinatorial Search
Hi-index | 0.00 |
Solving a problem in an unknown graph requires an agent to iteratively explore parts of the searched graph. Exploring an unknown graph can be very costly, for example, when the exploration requires activating a physical sensor or performing network I/O. In this paper we address the problem of searching for a given input pattern in an unknown graph, while minimizing the number of required exploration actions. This problem is analyzed theoretically. Then, algorithms that choose which part of the environment to explore next are presented. Among these are adaptations of existing algorithms for finding cliques in a known graph as well as a novel heuristic algorithm (Pattern *). Additionally, we investigate how probabilistic knowledge of the existence of edges can be used to further minimize the required exploration. With this additional knowledge we propose a Markov Decision Problem (MDP) formulation and a Monte-Carlo based algorithm (RPattern *) which greatly reduces the total exploration cost. As a case study, we demonstrate how the different heuristic algorithms can be implemented for the k-clique pattern as well as for the complete bipartite pattern. Experimental results are provided that demonstrate the strengths and weaknesses of the proposed approaches on random and scale-free graphs as well as on an online web crawler application searching in Google Scholar. In all the experimental settings we have tried, the proposed heuristic algorithms were able to find the searched pattern with substantially less exploration cost than random exploration.