Planar - PDFSEARCH.IO - Document Search Engine

Planar
Results: 1245

#	Item
621	Confluent Hasse Diagrams David Eppstein and Joseph A. Simons University of California, Irvine Goal: • Improve Readability of Hasse Diagrams Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2011-09-15 17:39:34 Structure Dedekind–MacNeille completion Hasse diagram Confluence Planar graph Dedekind cut Partially ordered set Order theory Graph theory Mathematics
622	Euler Formula Tanya Khovanova May 6, 2013 Class Discussion Euler formula: E + 2 = V + F . Proof. Euler formula for a sphere and a torus. Walter Wick’s Optical Tricks. Add to Reading List Source URL: www.tanyakhovanova.com Language: English - Date: 2013-12-12 14:13:35 Puzzles Water gas and electricity Planar graph Leonhard Euler Graph Tree Graph theory Mathematics Topological graph theory
623	Shortest Cut Graph of a Surface with Prescribed Vertex Set ´ Eric Colin de Verdi`ere⋆ ´ Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2010-06-23 07:19:49 Topological graph theory Network theory Planar graphs Algebraic graph theory Matroid theory Shortest path problem Dual graph Graph embedding Matroid Graph theory Mathematics Theoretical computer science
624	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems
625	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science
626	Open Problems from CCCG 2001 Erik D. Demaine∗ Joseph O’Rourke† The following is a list of the problems presented on Add to Reading List Source URL: www.cs.uleth.ca Language: English - Date: 2012-08-17 18:04:17 Triangulation Polyhedra Polygons Pseudotriangle Polytopes Polyhedron Dual polyhedron Octahedron Planar graph Geometry Euclidean geometry Euclidean plane geometry
627	CCCG 2004, Montreal, Quebec, August 9–11, 2004 Using Bistellar Flips for Rotations in Point Location Structures Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Mathematics Delaunay triangulation Tetrahedron Simplex Simplicial complex Convex hull Planar straight-line graph Triangulated irregular network Point location Geometry Triangulation Topology
628	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Zipper Unfolding of Domes and Prismoids Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 NP-complete problems Planar graphs Hamiltonian path Polyhedron Dodecahedron Graph theory Theoretical computer science Mathematics
629	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:00:20 Planar graphs Graph Unit disk graph Planar straight-line graph P Geographic routing Graph theory Theoretical computer science NP-complete problems
630	Finding a Minimal Tree in a Polygon with its Medial Axis Herman J. Haverkort Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:00:09 Graph connectivity Steiner tree problem Tree decomposition Tree Halin graph Chordal graph Graph Path Path decomposition Graph theory Planar graphs Graph operations

UPDATE