On testing Hamiltonicity of graphs |
| |
Authors: | Alexander Barvinok |
| |
Institution: | Department of Mathematics, University of Michigan, Ann Arbor, MI 48109-1043, USA |
| |
Abstract: | Let us fix a function f(n)=o(nlnn) and real numbers 0≤α<β≤1. We present a polynomial time algorithm which, given a directed graph G with n vertices, decides either that one can add at most βn new edges to G so that G acquires a Hamiltonian circuit or that one cannot add αn or fewer new edges to G so that G acquires at least e−f(n)n! Hamiltonian circuits, or both. |
| |
Keywords: | Permanent Graph Hamiltonian circuit Algorithm |
本文献已被 ScienceDirect 等数据库收录! |
|