209 search results - page 26 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
104
click to vote
ICPP
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper presents a distributed algorithm called LREMiT for extending the lifetime of a source-based multicast tree in wireless ad hoc networks (WANET). The lifetime of a multic...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
IPL
2002
14 years 9 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
BMCBI
2006
14 years 9 months ago
2006
Background: One type of DNA microarray experiment is discovery of gene expression patterns for a cell line undergoing a biological process over a series of time points. Two import...