1172 search results - page 187 / 235 » Path Algorithms on Regular Graphs |
115
click to vote
MP
2007
15 years 1 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
127
click to vote
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
: A series of genome-scale algorithms and high-performance implementations is described and shown to be useful in the genetic analysis of gene transcription. With them it is possib...
112
click to vote
AAIM
2009
Springer
15 years 8 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
107
click to vote
APPROX
2005
Springer
15 years 7 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
121
click to vote
NETWORKING
2007
15 years 3 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...