3008 search results - page 170 / 602 » Independence in connected graphs |
168
click to vote
3DPVT
2006
IEEE
16 years 18 days ago
2006
IEEE
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....
176
click to vote
ISCAS
2005
IEEE
16 years 3 days ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
188
click to vote
STOC
1992
ACM
15 years 10 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
195
click to vote
WAW
2007
Springer
16 years 19 days ago
2007
Springer
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
131
click to vote
JGT
2008
15 years 6 months ago
2008
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...