73 search results - page 2 / 15 » Labeling Schemes for Vertex Connectivity |
102
click to vote
JAL
2006
14 years 11 months ago
2006
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
104
click to vote
JGT
2010
14 years 10 months ago
2010
An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, . . . , m} such that all n vertex sums are...
SIROCCO
2008
15 years 1 months ago
2008
We consider a network represented by a simple connected undirected graph with N anonymous nodes that have local orientations, i.e. incident edges of each vertex have locally-unique...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
106
click to vote
CGF
2000
14 years 11 months ago
2000
Multiresolution shape representation is a very effective way to decompose surface geometry into several levels of detail. Geometric modeling with such representations enables flex...