370 search results - page 36 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
111
click to vote
CSB
2004
IEEE
15 years 5 months ago
2004
IEEE
There is considerable interest in computational methods to assist in the use of genetic polymorphism data for locating disease-related genes. Haplotypes, contiguous sets of correl...
121
Voted
CJ
1999
15 years 1 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
127
click to vote
PODC
2011
ACM
14 years 4 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
144
click to vote
ISBRA
2009
Springer
15 years 8 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
136
click to vote
TCS
2010
15 years 9 days ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...