EWCG 2005, Eindhoven, March 9–11, 2005 On Computing Fr´ - Path graph - Document - PDFSEARCH.IO

First Page	Meta Content
	EWCG 2005, Eindhoven, March 9–11, 2005 On Computing Fr´ Add to Reading List Document Date: 2008-08-30 07:07:40 Open Document File Size: 240,35 KB Share Result on Facebook Country Canada / / / Facility Carleton University / / IndustryTerm binary search / polynomial time algorithm / rst search / / NaturalFeature D. M.Mount / / Organization School of Computer Science / Carleton University / Ottawa / / Technology polynomial time algorithm / Approximation Algorithms / 3 Algorithm / / SocialTag Polyhedra Polygons Polyhedron Dual polyhedron Discrete geometry Directed acyclic graph Shortest path problem Computational geometry Net Geometry

EWCG 2005, Eindhoven, March 9–11, 2005 On Computing Fr´Add to Reading List