982 search results - page 149 / 197 » Solving Steiner tree problems in graphs to optimality |
115
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
122
Voted
BIOCOMP
2008
15 years 2 months ago
2008
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
90
Voted
EDBT
2006
ACM
16 years 20 days ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
WABI
2007
Springer
15 years 6 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
106
Voted
ICSE
2008
IEEE-ACM
16 years 1 months ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...