1986 search results - page 127 / 398 » Path Separability of Graphs |
ACIIDS
2009
IEEE
14 years 29 days ago
2009
IEEE
Inter domain service routing is an element in the success of Next Generation Network. Service requests, such as the INVITE request in Session Initiation Protocol [21] may need to ...
COMBINATORICA
2008
13 years 9 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
IOR
2011
13 years 3 months ago
2011
We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values i...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...
ICNP
2002
IEEE
14 years 1 months ago
2002
IEEE
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...