Finding patterns in an unknown graph

AI Communications

Volumn 25, Issue 3, 2012, Pages 229-256

  Stern, Roni ^a   Kalech, Meir ^a   Felner, Ariel ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Heuristic search; subgraph isomorphism; unknown graphs

Indexed keywords

ADDITIONAL KNOWLEDGE; GOOGLE SCHOLAR; HEURISTIC SEARCH; INPUT PATTERNS; K-CLIQUE; MARKOV DECISION PROBLEM; MONTE CARLO; PHYSICAL SENSORS; PROBABILISTIC KNOWLEDGE; SCALE FREE GRAPH; SUBGRAPH ISOMORPHISM; UNKNOWN GRAPHS; WEB CRAWLERS;

PROBLEM SOLVING;

HEURISTIC ALGORITHMS;

EID: 84865468840     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: 10.3233/AIC-2012-0532     Document Type: Article

References (57)

1. Y. Altshuler, A. Matsliah and A. Felner, On the complexity of physical problems and a swarm algorithm for the k-clique search in physical graphs, in: Proceedings of the First European Conference on Complex Systems, Paris, France, 2005.
2. S. Argamon-Engelson, S. Kraus and S. Sina, Interleaved vs. a priori exploration for repeated navigation in a partiallyknown graph, Int. J. Pattern Recogn. Artif. Intell. 13(7) (1999), 963-968.
3. B. Awerbuch, M. Betke, R.L. Rivest and M. Singh, Piecemeal graph exploration by a mobile robot, in: Information and Computation, Elsevier, New York, NY, 1995, pp. 321-328.
4. A.L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286(5439) (1999), 509-512.
5. R. Battiti and F. Mascia, Reactive and dynamic local search for max-clique: engineering effective building blocks, Comp. Oper. Res. 37 (2009), 534-542.
6. R. Battiti and M. Protasi, Reactive local search for the maximum clique problem, Algorithmica 29(4) (2001), 610-637.
7. R. Bellman, Dynamic programming treatment of the travelling salesman problem, J. ACM 9(1) (1962), 61-63.
8. Y. Björnsson, V. Bulitko and N.R. Sturtevant, TBA*: timebounded a*, in: Proceedings of the International Joint Conference on Artificial Intelligence, AAAI Press, Pasadena, CA, 2009, pp. 431-436.
9. B. Bollobás, Random Graphs, Cambridge Univ. Press, Cambridge, 2001.
10. B. Bollobás and P. Erdos, Cliques in random graphs, in: Mathematical Proceedings of the Cambridge Philosophical Society, Cambridge Univ. Press, Cambridge, 1976, pp. 419-427.
11. A. Bonato and W. Laurier, A survey of models of the web graph, in: Combinatorial and Algorithmic Aspects of Networking, Springer, Berlin/Heidelberg, 2004, pp. 159-172.
12. J.A. Bondy and U.S.R. Murty, Graph Theory With Applications, Elsevier, Amsterdam, 1976.
13. B. Bonet, Deterministic POMDPs revisited, in: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, Seattle, WA, 2009, pp. 59-66.
14. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge Univ. Press, New York, NY, 1998.
15. C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Commun. ACM 16(9) (1973), 575-577.
16. J. Bruce and M. Veloso, Real-time randomized path planning for robot navigation, in: RoboCup'2002: Robot Soccer World Cup VI, G.A. Kaminka, P.U. Lima and R. Rojas, eds, Lecture Notes in Computer Science, Vol. 2752, Springer, Berlin/Heidelberg, 2003, pp. 288-295.
17. A. Cassandra, M.L. Littman and N.L. Zhang, Incremental pruning: a simple, fast, exact method for partially observable Markov decision processes, in: Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, 1997, pp. 54-61.
18. S.G.K. Christian, A. Duncan and V.S.A. Kumar, Optimal constrained graph exploration, ACM Trans. Algorithms 2(3) (2006), 380-402.
19. P. Cucka, N.S. Netanyahu and A. Rosenfeld, Learning in navigation goal finding in graphs, Int. J. Pattern Recogn. Artif. Intell. 10(5) (1996), 429-446.
20. D. Donato, L. Laura, S. Leonardi and S. Millozzi, Simulating the webgraph: a comparative analysis of models, Comput. Sci. Eng. 6(6) (2004), 84-89.
21. B. Donnet and T. Friedman, Internet topology discovery: a survey, IEEE Commun. Surv. Tutor. 9(4) (2007), 2-15.
22. D. Eppstein, Subgraph isomorphism in planar graphs and related problems, in: Proceedings of the 6th Annual Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 1995, pp. 632-640.
23. D. Eppstein and J.Wang, A steady state model for graph power laws, in: Proceedings of the 2nd International Workshop on Web Dynamics, Honolulu, 2002.
24. P. Erdos and A. Rényi, On random graphs I, Publ. Math. Debrec. 6 (1959), 290-297.
25. A. Felner, R. Stern, A. Ben-Yair, S. Kraus and N. Netanyahu, PhA*: finding the shortest path with A* in unknown physical environments, J. Artif. Intell. Res. 21 (2004), 631-679.
26. A. Felner, R. Stern and S. Kraus, PhA*: performing A* in unknown physical environments, in: Proceedings of the 1st International Joint Conference on Autonomous Agents and Multiagent Systems, Bologna, Italy, ACM Press, New York, NY, 2002, pp. 240-247.
27. R. Fleischer and G. Trippen, Exploring an unknown graph efficiently, in: Proceedings of the 13th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 3669, Springer, Berlin/Heidelberg, 2005, pp. 11-22.
28. Y. Gabriely and E. Rimon, CBUG: a quadratically competitive mobile robot navigation algorithm, in: Proceedings of the International Conference on Robotics and Automation, IEEE Press, 2005, pp. 954-960.
29. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, 1979.
30. A. Gilboa, A. Meisels and A. Felner, Distributed navigation in an unknown physical environment, in: Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems, ACM Press, New York, NY, 2006, pp. 553-560.
31. L. Gkasieniec, R. Klasing, R. Martin, A. Navarra and X. Zhang, Fast periodic graph exploration with constant memory, J. Comp. Syst. Sci. 74(5) (2008), 808-822.
32. E.A. Hansen and S. Zilberstein, LAO*: a heuristic search algorithm that finds solutions with loops, Artif. Intell. 129(1,2) (2001), 35-62.
33. B. Kalyanasundaram and K.R. Pruhs, Constructing competitive tours from local information, Theoret. Comput. Sci. 130(1) (1994), 125-138.
34. M.Y. Kan, Web page classification without the web page, in: Proceedings of the 13th International World Wide Web Conference (WWW) on Alternate Track Papers and Posters, ACM Press, New York, NY, 2004, pp. 262-263.
35. M.Y. Kan and H.O.N. Thi, Fast webpage classification using URL features, in: Proceedings of the 14th ACM International Conference on Information and Knowledge Management, ACM Press, New York, NY, 2005, pp. 325-326.
36. I.C. Kim, Real-time search algorithms for exploration and mapping, in: Proceedings of the 10th International Conference on Knowledge-Based Intelligent Information and Engineering, Lecture Notes in Computer Science, Vol. 4251, Springer, Berlin/Heidelberg, 2006, pp. 244-251.
37. R.E. Korf, Real-time heuristic search, Artif. Intell. 42(2,3) (1990), 189-211.
38. P.A. Laplante, Dictionary of Computer Science, Engineering and Technology, CRC Press, Boca Raton, FL, 2001.
39. M.L. Littman, Algorithms for sequential decision-making, PhD thesis, Brown Univ., 1996.
40. R. Meshulam, A. Felner and S. Kraus, Utility-based multiagent system for performing repeated navigation tasks, in: Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems, ACM Press, New York, NY, 2005, pp. 887-894.
41. P.R.J. Östergård, A fast algorithm for the maximum clique problem, Discr. Appl. Math. 120(1-3) (2002), 197-207.
42. P. Panaite and A. Pelc, Exploring unknown undirected graphs, in: Proceedings of the 9th Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 1998, pp. 316-322.
43. P.M. Pardalos, J. Rappe andM.G.C. Resende, An exact parallel algorithm for the maximum clique problem, in: High Performance and Software in Nonlinear Optimization, R. de Leone, A. Murli, P. Pardalos and G. Toraldo, eds, Kluwer Academic, Dordrecht, 1997, pp. 279-300.
44. J. Pineau, G. Gordon and S. Thrun, Point-based value iteration: an anytime algorithm for POMDPs, in: Proceedings of the 16th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, 2003, pp. 1025-1032.
45. W. Pullan and H.H. Hoos, Dynamic local search for the maximum clique problem, J. Artif. Intell. Res. 25 (2006), 159-185.
46. M.L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, Wiley, New York, 1994.
47. D.C. Rayner, K. Davison, V. Bulitko, K. Anderson and J. Lu, Real-time heuristic search with a priority queue, in: Proceedings of the International Joint Conference on Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, 2007, pp. 2372-2377.
48. M.D. Santo, P. Foggia, C. Sansone and M. Vento, A large database of graphs and its use for benchmarking graph isomorphism algorithms, Pattern Recogn. Lett. 24(8) (2003), 1067-1079.
49. H. Shang, Y. Zhang, X. Lin and J.X. Yu, Taming verification hardness: an efficient algorithm for testing subgraph isomorphism, VLDB Endowment 1 (2008), 364-375.
50. L. Shmoulian and E. Rimon, Roadmap-A*: an algorithm for minimizing travel effort in sensor based mobile robot navigation, in: Proceedings of the International Conference on Robotics and Automation, Leuven, Belgium, IEEE Press, 1998, pp. 356-362.
51. G. Siganos,M. Faloutsos, P. Faloutsos and C. Faloutsos, Power laws and the AS-level internet topology, IEEE/ACM Trans. Netw. 11(4) (2003), 514-524.
52. R. Stern, M. Kalech and A. Felner, Searching for a k-clique in unknown graphs, in: Proceedings of the International Symposium on Combinatorial Search, AAAI Press, 2010, pp. 83-89.
53. S. Thrun, W. Burgard and D. Fox, Probabilistic Robotics (Intelligent Robotics and Autonomous Agents), MIT Press, Cambridge, MA, 2005.
54. E. Tomita and T. Kameda, An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, J. Global Optim. 37(1) (2007), 95-111.
55. J.R. Ullmann, An algorithm for subgraph isomorphism, J. ACM 23(1) (1976), 31-42.
56. G. Valiente and C. Martínez, An algorithm for graph patternmatching, in: Proceedings of the 4th South American Workshop on String Processing, International Informatics, Vol. 8, Carleton Univ. Press, Ottawa, ON, 1997, pp. 180-197.
57. E.W. Weisstein, Mathworld-a wolfram web resource, complete bipartite graph, available at: http://mathworld.wolfram. com/CompleteBipartiteGraph.html, 2011.