Unit Disk Graph Approximation∗ Fabian Kuhn Thomas Moscibroda Roger Wattenhofer

First Page		Document Content
Date: 2004-08-11 12:11:55 Graph Connectivity Topology Graph coloring Petersen graph Planar separator theorem Graph theory NP-complete problems Unit disk graph		Unit Disk Graph Approximation∗ Fabian Kuhn Thomas Moscibroda Roger Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Download Document from Source Website File Size: 178,55 KB Share Document on Facebook

	The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree V´ıt Jel´ınek1 , Eva Jel´ınkov´a1 , Jan Kratochv´ıl12 , Bernard Lidick´ y1 , Marek Tesaˇr1 , Tom´aˇs 12 Vyskoˇcil DocID: 1rnTu - View Document
	Reorder.js: A JavaScript Library to Reorder Tables and Networks Jean-Daniel Fekete To cite this version: Jean-Daniel Fekete. Reorder.js: A JavaScript Library to Reorder Tables and Networks. IEEE DocID: 1riP1 - View Document
	Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory DocID: 1rcqn - View Document
	A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a DocID: 1ra7T - View Document
	Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p DocID: 1r43q - View Document