1648 search results - page 12 / 330 » On the generation of bicliques of a graph |
COMBINATORICA
2000
14 years 9 months ago
2000
Given a connected graph, X, we denote by 2 = 2(X) its smallest non-zero Laplacian eigenvalue. In this paper we show that among all sets of n - 1 transpositions which generate the ...
EOR
2006
14 years 9 months ago
2006
: Aimed at detection of parallel assembly modes, a method for assembly graph construction is described that is based on the systematic generation and analysis of precedence relatio...
ARSCOM
2007
14 years 9 months ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
RSA
2008
14 years 9 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
107
click to vote
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...