87 search results - page 2 / 18 » A Faster Algorithm for Minimum Cycle Basis of Graphs |
CORR
2011
Springer
13 years 2 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...
IPL
2007
13 years 7 months ago
2007
This paper presents a construction of a minimum cycle basis for the direct product of two complete graphs on three or more vertices. With the exception of two special cases, such ...
ICALP
1994
Springer
13 years 12 months ago
1994
Springer
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...