10608 search results - page 22 / 2122 » Complexity of O'Hara's Algorithm |
135
click to vote
EOR
2008
15 years 4 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
141
click to vote
PRDC
2008
IEEE
15 years 10 months ago
2008
IEEE
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
117
click to vote
CADE
1992
Springer
15 years 8 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
131
click to vote
JSAC
2006
15 years 4 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
131
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )