686 search results - page 30 / 138 » Packing Cycles in Graphs |
108
click to vote
SPAA
1993
ACM
15 years 4 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
91
Voted
JGT
2010
14 years 10 months ago
2010
: Let G be a toroidal graph without cycles of a fixed length k, and l(G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant...
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
102
click to vote
SIAMDM
2008
15 years 9 days ago
2008
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n +I denote Kn,n with a 1-factor added. It is proved in this paper that there exists an m-c...
111
click to vote
ISSS
2000
IEEE
15 years 4 months ago
2000
IEEE
In data dominated applications, like multi-media and telecom applications, data storage and transfers are the most important factors in terms of energy consumption, area and syste...