Sciweavers

601 search results - page 35 / 121
» Edge-dominating cycles in graphs
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 5 months ago
Planar Cycle Covering Graphs
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...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
SIAMDM
2008
122views more  SIAMDM 2008»
13 years 9 months ago
Cycle Systems in the Complete Bipartite Graph Plus a One-Factor
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...
Liqun Pu, Hao Shen, Jun Ma, San Ling
ISSS
2000
IEEE
127views Hardware» more  ISSS 2000»
14 years 1 months ago
Low Power Storage Cycle Budget Distribution Tool Support for Hierarchical Graphs
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...
Erik Brockmeyer, Arnout Vandecappelle, Sven Wuytac...
STACS
2009
Springer
14 years 4 months ago
Computing Graph Roots Without Short Cycles
Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngo...