370 search results - page 50 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
141
Voted
GD
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
179
Voted
EC
2011
14 years 10 months ago
2011
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...
127
click to vote
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
113
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
112
Voted
NIPS
2008
15 years 4 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...