CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Optimal Data Structures for Farthest-Point Queries in Cactus Networks∗ Prosenjit Bose† Jean-Lou De Carufel†

First Page		Document Content
Date: 2013-08-11 21:51:56 Network theory Computational geometry Diagrams Discrete geometry Voronoi diagram Pseudoforest Connectivity Biconnected component Tree Graph theory Mathematics Theoretical computer science		CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Optimal Data Structures for Farthest-Point Queries in Cactus Networks∗ Prosenjit Bose† Jean-Lou De Carufel† Add to Reading List Source URL: www.cccg.ca Download Document from Source Website File Size: 343,33 KB Share Document on Facebook

	Under review for TGIS special issue FOSS4G2013 Towards an Open Source Analysis Toolbox for Street Network Comparison: Indicators, Tools and Results of a Comparison of OSM and the Official Austrian Reference Graph DocID: 1rkdH - View Document
	Network Analysis and Modeling, CSCI 5352 LectureProf. Aaron Clauset DocID: 1r8wD - View Document
	Finding Textures in Sketches using Planar Ising Models Matthew D. McLure, Subu Kandaswamy, and Kenneth D. Forbus Northwestern University Abstract Creating software that can understand the range of sketches DocID: 1pUok - View Document
	PHYSICAL REVIEW E, VOLUME 64, Are randomly grown graphs really random? Duncan S. Callaway,1 John E. Hopcroft,2 Jon M. Kleinberg,2 M. E. J. Newman,3,4 and Steven H. Strogatz1,4 1 DocID: 1pjpk - View Document
	Inference, Models and Simulation for Complex Systems Lecture 13 Prof. Aaron Clauset 1 DocID: 1pask - View Document