370 search results - page 32 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
ICCNMC
2005
Springer
15 years 7 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
121
click to vote
ESA
2005
Springer
15 years 7 months ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
SWAT
1990
Springer
15 years 6 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
110
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
123
click to vote
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...