8 search results - page 1 / 2 » Approximately Counting Hamilton Cycles in Dense Graphs |
49
Voted
SODA
1994
ACM
15 years 8 days ago
1994
ACM
110
Voted
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
107
Voted
STACS
2007
Springer
15 years 5 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
94
Voted
ICALP
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
86
Voted
ROBOCUP
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...