982 search results - page 113 / 197 » Solving Steiner tree problems in graphs to optimality |
168
Voted
ALGORITHMICA
1998
15 years 5 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
162
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
151
Voted
INFOCOM
2007
IEEE
16 years 4 days ago
2007
IEEE
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
194
click to vote
EVOW
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in ...
195
click to vote
ISPD
1997
ACM
15 years 10 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...