We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619n) time and polynomial space. For bipartite graphs, we give a 1.5npoly(n) expected time algorithm. Our algorithms are based on a new combinatorial formula for the number of Hamiltonian cycles modulo a positive integer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices o...
International audienceIn this paper, we prove that, given a clique-width k-expression of an n-vertex...
We design a randomized algorithm that finds a Hamilton cycle in O(n) time with high probability in a...
Dirac's theorem (1952) is a classical result of graph theory, stating that an $n$-vertex graph ($n \...
The best worst case guarantee algorithm to see if a graph has a Hamiltonian cycle, a closed tour vis...
We present a Monte Carlo algorithm that detects the presence of a Hamiltonian cycle in an n-vertex u...
AbstractWe propose an improved algorithm for counting the number of Hamiltonian cycles in a directed...
For an even integer t \geq 2, the Matchings Connecivity matrix H_t is a matrix that has rows and col...
We present a Monte Carlo algorithm for Hamiltonicity detection in an $n$-vertex undirected graph run...
We are motivated by a tantalizing open question in exact algorithms: can we detect whether an n-vert...
In this paper, we prove that, given a clique-width k-expression of an n-vertex graph, Hamiltonian Cy...
Dirac’s theorem (1952) is a classical result of graph theory, stating that an n-vertex graph (n≥3n≥3...
The Hamiltonian Cycle problem is the problem of deciding whether an n-vertex graph G has a cycle pas...
For even k ϵ N, the matchings connectivity matrix Mk is a binary matrix indexed by perfect matchings...
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices o...
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices o...
International audienceIn this paper, we prove that, given a clique-width k-expression of an n-vertex...
We design a randomized algorithm that finds a Hamilton cycle in O(n) time with high probability in a...
Dirac's theorem (1952) is a classical result of graph theory, stating that an $n$-vertex graph ($n \...
The best worst case guarantee algorithm to see if a graph has a Hamiltonian cycle, a closed tour vis...
We present a Monte Carlo algorithm that detects the presence of a Hamiltonian cycle in an n-vertex u...
AbstractWe propose an improved algorithm for counting the number of Hamiltonian cycles in a directed...
For an even integer t \geq 2, the Matchings Connecivity matrix H_t is a matrix that has rows and col...
We present a Monte Carlo algorithm for Hamiltonicity detection in an $n$-vertex undirected graph run...
We are motivated by a tantalizing open question in exact algorithms: can we detect whether an n-vert...
In this paper, we prove that, given a clique-width k-expression of an n-vertex graph, Hamiltonian Cy...
Dirac’s theorem (1952) is a classical result of graph theory, stating that an n-vertex graph (n≥3n≥3...
The Hamiltonian Cycle problem is the problem of deciding whether an n-vertex graph G has a cycle pas...
For even k ϵ N, the matchings connectivity matrix Mk is a binary matrix indexed by perfect matchings...
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices o...
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices o...
International audienceIn this paper, we prove that, given a clique-width k-expression of an n-vertex...
We design a randomized algorithm that finds a Hamilton cycle in O(n) time with high probability in a...
DOI
Add to ORKG