4865 search results - page 214 / 973 » The Complexity of Graph Connectivity |
127
Voted
ISCAS
2005
IEEE
15 years 9 months 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 ...
143
Voted
STOC
1992
ACM
15 years 8 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 ...
155
click to vote
WAW
2007
Springer
15 years 10 months 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...
103
click to vote
JGT
2008
15 years 3 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...
123
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
The seminal work of Hubel and Wiesel [14] and the vast amount of work that followed it prove that hierarchies of increasingly complex cells play a central role in cortical computa...