Partitioning graphs into Hamiltonian ones
From MaRDI portal
Publication:1352030
DOI10.1016/0167-8191(95)00007-0zbMath0875.68711OpenAlexW2052379151MaRDI QIDQ1352030
Publication date: 27 February 1997
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(95)00007-0
Parallel algorithmsHamiltonian graphsBipartite permutation graphsGraph partitionTime and processor requirements
Related Items (1)
This page was built for publication: Partitioning graphs into Hamiltonian ones