CCCG 2006, Kingston, Ontario, August 14–16, 2006 Spanning trees across axis-parallel segments Michael Hoffmann∗ Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the - Path graph - Document - PDFSEARCH.IO

First Page	Meta Content
	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Spanning trees across axis-parallel segments Michael Hoffmann∗ Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the Add to Reading List Document Date: 2008-10-27 22:58:24 Open Document File Size: 275,06 KB Share Result on Facebook City Kingston / Boca Raton / / Company ACM Press / Lethbridge AB / CRC Press / / / Organization Department of Mathematics / MIT / Institute for Theoretical Computer Science / / Person P. Widmayer / / ProgrammingLanguage FL / / ProvinceOrState Florida / Ontario / / PublishedMedium Theoretical Computer Science / / Technology p2 Algorithm / segments Algorithm / 2006 Algorithm / following algorithm / 5 In Algorithm / 2.2 Main Algorithm / / SocialTag Spanning tree Network theory Shortest path problem Minimum spanning tree Theoretical computer science Graph theory Mathematics

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Spanning trees across axis-parallel segments Michael Hoffmann∗ Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the Add to Reading List