1163 search results - page 38 / 233 » Embedding into Bipartite Graphs |
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
IPL
2006
13 years 8 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
JCT
2006
13 years 8 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
CORR
2007
Springer
13 years 7 months ago
2007
Springer
In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network str...
RSA
2002
13 years 7 months ago
2002
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...