434 search results - page 25 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
103
click to vote
CPAIOR
2011
Springer
14 years 1 months ago
2011
Springer
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
ESCIENCE
2007
IEEE
15 years 1 months ago
2007
IEEE
Increasing the efficiency of meander line antennas is an important real-world problem within radio frequency identification (RFID). Meta-heuristic search algorithms, such as ant c...
BMCBI
2010
14 years 7 months ago
2010
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
124
click to vote
SECON
2010
IEEE
14 years 7 months ago
2010
IEEE
Nodes in a cognitive radio mesh network may select from a set of available channels to use provided they do not interfere with primary users. This ability can improve overall netwo...
WALCOM
2010
IEEE
14 years 7 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...