73 search results - page 9 / 15 » Labeling Schemes for Vertex Connectivity |
69
Voted
ICPPW
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract—It is expected that GMPLS-based recovery could become a viable option for obtaining faster restoration than layer 3 rerouting. Even though dedicated restoration ensures ...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
SIAMDM
2008
14 years 9 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
A new data structure for representing the color of rays from multiple-view images is presented. The structure is a hexagonal tessellation generated from a buckyball. Using the str...
ICDCS
2010
IEEE
14 years 8 months ago
2010
IEEE
—Networks based on Ethernet bridging scale poorly as bridges flood the entire network repeatedly, and several schemes have been proposed to mitigate this flooding problem; howe...