2063 search results - page 99 / 413 » connection 2007 |
140
click to vote
IPCO
1993
15 years 5 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
130
click to vote
ADHOC
2007
15 years 4 months ago
2007
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
121
click to vote
AML
2006
15 years 4 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
116
click to vote
EJC
2007
15 years 4 months ago
2007
Let G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least seven vertices with exactly two Laplacian eigenvalues greater than 2. In addition, all mi...
114
click to vote
APPML
2005
15 years 4 months ago
2005
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...