641 search results - page 75 / 129 » On Planar Quasi-Parity Graphs |
INFORMATICALT
2006
14 years 12 months ago
2006
In this work labeling of planar graphs is taken up which involves labeling the p vertices, the q edges and the f internal faces such that the weights of the faces form an arithmeti...
100
click to vote
GD
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
131
click to vote
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
101
click to vote
CCCG
2007
15 years 1 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
CIAC
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...