A new algorithm for finding minimal cycle-breaking sets of turns in a graph.
Levitin, Lev, Karpovsky, Mark, Mustafa, Mehmet, Zakrevski, Lev (2006)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Hamilton decompositions and -factorizations of hypercubes.”
A new algorithm for finding minimal cycle-breaking sets of turns in a graph.
Bent Hamilton cycles in -dimensional grid graphs.
Ruskey, F., Sawada, Joe (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Hamilton circuit problem on grids
Foto Afrati (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Minimum cut in directed planar networks
Ladislav Janiga, Václav Koubek (1992)
Kybernetika
Similarity:
Scheduled hot-potato routing.
Naor, Joseph, Orda, Ariel, Rom, Raphael (1998)
Journal of Graph Algorithms and Applications
Similarity:
Searching for Kaprekar's constants: algorithms and results.
Walden, Byron L. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Some gregarious cycle decompositions of complete equipartite graphs.
Smith, Benjamin R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs.
Frieze, Alan (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the parallel complexity of the alternating hamiltonian cycle problem
E. Bampis, Y. Manoussakis, I. Milis (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order.
Stevens, Brett (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity: