Results 241 to 243 of about 96,628 (243)
Israel Journal of Mathematics, 1971 We investigate a class of bipartite graphs, whose structure is determined by a binary number.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Canadian Journal of Mathematics, 1958
For the purpose of analysing bipartite graphs (hereinafter called simply graphs) the concept of an exterior covering is introduced. In terms of this concept it is possible in a natural way to decompose any graph into two parts, an inadmissible part and a core.
A. L. Dulmage, N. S. Mendelsohn
openaire +2 more sources
For the purpose of analysing bipartite graphs (hereinafter called simply graphs) the concept of an exterior covering is introduced. In terms of this concept it is possible in a natural way to decompose any graph into two parts, an inadmissible part and a core.
A. L. Dulmage, N. S. Mendelsohn
openaire +2 more sources
Physical Review Letters, 1987
Replica-symmetric solutions of the graph-bipartitioning problem with finite connectivity are presented. With the constraint ${sum}_{\mathrm{i}=1}^{\mathrm{N}}$${\mathrm{S}}_{\mathrm{i}}$=0 strictly enforced, another solution can be obtained, which gives a lower cost function than that given by the spin-glass solution.
openaire +3 more sources
Replica-symmetric solutions of the graph-bipartitioning problem with finite connectivity are presented. With the constraint ${sum}_{\mathrm{i}=1}^{\mathrm{N}}$${\mathrm{S}}_{\mathrm{i}}$=0 strictly enforced, another solution can be obtained, which gives a lower cost function than that given by the spin-glass solution.
openaire +3 more sources