Finding the most relevant fragments in networks

Journal of Graph Algorithms and Applications

Volumn 14, Issue 2, 2010, Pages 307-336

  Buchin, Kevin ^a   Cabello, Sergio ^b   Gudmundsson, Joachim ^c   Löffler, Maarten ^d   Luo, Jun ^e   Rote, Günter ^f   Silveira, Rodrigo I ^g   Speckmann, Bettina ^a   Wolle, Thomas ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

^c CSIRO   (Australia)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e SHENZHEN INSTITUTES OF ADVANCED TECHNOLOGY   (China)

^f FREIE UNIVERSITÄT BERLIN   (Germany)

^g UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84910650252     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00209     Document Type: Article

References (39)

1. K. Aerts, C. Lathuy, T. Steenberghen, and I. Thomas. Spatial clustering of traffic accidents using distances along the network. In Proc. 19th Work- shop of the International Cooperation on Theories and Concepts in Traffic Safety, 2006.
2. E. M. Arkin, J. S. B. Mitchell, and G. Narasimhan. Resource-constrained geometric network optimization. In Proc. 14th Ann. Symposium on Computational Geometry, pages 307-316, 1998.
3. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic and Discrete Methods, 8:277-284, 1987.
4. B. Awerbuch, Y. Azar, A. Blum, and S. Vempala. New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. SIAM Journal on Computing, 28(1):254-262, 1998.
5. L. W. Beineke and R. R. Pippert. The number of labeled dissections of a k-ball. Math. Ann., 191:87-98, 1971.
6. M. A. Bender, M. Farach-Colton, G. Pemmasani, S. S. Skiena, and P. Sumazin. Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms, 57(2):75-94, 2005.
7. A. Blum, S. Chawla, D. R. Karger, T. Lane, A. Meyerson, and M. Minkoff. Approximation algorithms for orienteering and discounted-reward TSP. SIAM Journal on Computing, 37(2):653-670, 2007.
8. H. Bodlaender. Treewidth: Structure and algorithms. In Proc. 14th Colloquium on Structural Information and Communication Complexity, number 4474 in LNCS, pages 11-25, 2007.
9. M. R. Brown and R. E. Tarjan. A fast merging algorithm. J. ACM, 26(2):211-226, 1979.
10. M. Celik, S. Shekhar, B. George, J. P. Rogers, and J. A. Shine. Discovering and quantifying mean streets: A summary of results. Technical Report 07- 025, University of Minnesota, Computer Science and Engineering, 2007.
11. C. Chekuri, N. Korula, and M. P,et al. Improved algorithms for orienteering and related problems. In Proc. 19th ACM-SIAM Symp. Discrete Algorithms, pages 661-670, 2008.
12. K. Chen and S. Har-Peled. The orienteering problem in the plane revisited. In Proc. 22nd Ann. Symposium on Computational Geometry, pages 247- 254, 2006.
13. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press and McGraw-Hill, 2nd edition, 2001.
14. S. Fotheringham and P. Rogerson. Spatial Analysis and GIS. Taylor and Francis, London, 1994.
15. M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NPcomplete graph problems. Theoretical Comp. Sci., 1:237-267, 1976.
16. N. Garg. Saving an epsilon: a 2-approximation for the k-MST problem in graphs. In Proc. 37th ACM Symposium on Theory of Computing, pages 396-402, 2005.
17. B. Golden, L. Levy, and R. Vohra. The orienteering problem. Naval Research Logistics, 34:307-318, 1987.
18. S. Huddleston and K. Mehlhorn. A new data structure for representing sorted lists. Acta Informatica, 17:157-184, 1982.
19. Illinois Criminal Justice Information Authority. STAC User Manual, 1996.
20. A. P. Jones, I. H. Langford, and G. Bentham. The application of K-function analysis to the geographical distribution of road traffic accident outcomes in Norfolk, England. Social Science & Medicine, 42(6):879 - 885, 1996.
21. D. Karger, R. Motwani, and G. D. S. Ramkumar. On approximating the longest path in a graph. Algorithmica, 18(1):82-98, 1997.
22. T. Kloks. Treewidth. PhD thesis, Utrecht University, 1993.
23. N. Levine. Crime mapping and the Crimestat program. Geographical Analysis, 38:41-56, 2005.
24. H. Miller and J. Han, editors. Geographic Data Mining and Knowledge Discovery. CRC Press, 2001.
25. H. J. Miller and S.-L. Shaw. Geographic Information Systems for Transportation: Principles and Applications. Oxford University Press, 2nd edition, 2001.
26. A. Okabe, K. Okunuki, and S. Shiode. SANET: a toolbox for spatial analysis on a network. Geographical Analysis, 38(1):57-66, 2006.
27. D. O'Sullivan and D. Unwin. Geographic Information Analysis. Wiley, 2002.
28. C. H. Papadimitriou and U. V. Vazirani. On two geometric problems related to the traveling salesman problem. Journal of Algorithms, 5(2):231-246, 1984.
29. J. H. Ratcliffe. The hotspot matrix: A framework for the spatio-temporal targeting of crime reduction. Police Practice and Research, 5:05-23, 2004.
30. J. H. Ratcliffe and M. J. McCullagh. Aoristic crime analysis. International Journal of Geographical Information Science, 12:751-764, 1998.
31. R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, and S. S. Ravi. Spanning trees - short or small. SIAM Journal on Discrete Mathematics, 9(2):178-200, 1996.
32. T. Rich. Crime mapping and analysis by community organizations in hartford, connecticut. National Institute of Justice: Research in Brief, pages 1-11, 2001.
33. N. Robertson and P. D. Seymour. Graph minors. I. Excluding a forest. Journal of Combinatorial Theory, Series B, 35:39-61, 1983.
34. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7:309-322, 1986.
35. G. Rote. Binary trees having a given number of nodes with 0, 1, and 2 children. Séminaire Lotharingien de Combinatoire, B38b, 1997. Comment on a paper by H. Prodinger, 6 pages.
36. P. G. Spooner, I. D. Lunt, A. Okabe, and S. Shiode. Spatial analysis of roadside Acacia populations on a road network using the network kfunction. Landscape Ecology, 19:491-499, 2004.
37. T. Steenberghen, T. Dufays, I. Thomas, and B. Flahaut. Intra-urban location and clustering of road accidents using GIS: a Belgian example. International Journal of Geographical Information Science, 18:169-181, 2004.
38. J. Stillwell and G. Clarke. Applied GIS and Spatial Analysis. Wiley, 2005.
39. I. Yamada and J. Thill. Local indicators of network-constrained clusters in spatial point patterns. Geographical Analysis, 39:268-292, 2007.