Sciweavers

641 search results - page 37 / 129
» On Planar Quasi-Parity Graphs
Sort
View
ICNP
2005
IEEE
15 years 11 months ago
Simple Robotic Routing in Ad Hoc Networks
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
Daejoong Kim, Nicholas F. Maxemchuk
ALGOSENSORS
2004
Springer
15 years 11 months ago
On a Conjecture Related to Geometric Routing
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
Christos H. Papadimitriou, David Ratajczak
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
15 years 6 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
ICALP
2009
Springer
16 years 6 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
151
Voted
STOC
2010
ACM
274views Algorithms» more  STOC 2010»
16 years 3 months ago
Odd Cycle Packing
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
Ken-ichi Kawarabayashi and Bruce Reed