Search Sciweavers | Sciweavers

641 search results - page 24 / 129

» On Planar Quasi-Parity Graphs

click to vote

GD
2009
Springer

137views Computer Graphics» more GD 2009»

Manhattan-Geodesic Embedding of Planar Graphs

15 years 6 months ago

Download www1.informatik.uni-wuerzburg.de

In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...

Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander...

claim paper

Read More »

134

click to vote

COMPGEOM
2006
ACM

194views Discrete Geometry» more COMPGEOM 2006»

Minimum weight triangulation is NP-hard

15 years 8 months ago

Download www.cs.princeton.edu

A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...

Wolfgang Mulzer, Günter Rote

claim paper

Read More »

click to vote

STOC
2003
ACM

119views Algorithms» more STOC 2003»

Constant factor approximation of vertex-cuts in planar graphs

16 years 2 months ago

Download faculty.cs.tamu.edu

Eyal Amir, Robert Krauthgamer, Satish Rao

claim paper

Read More »