370 search results - page 17 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
101
click to vote
WDAG
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
DCC
2002
IEEE
15 years 11 months ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
102
Voted
CORR
2012
Springer
13 years 7 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
80
Voted
GD
2009
Springer
15 years 4 months ago
2009
Springer
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...