Partitioning graphs into Hamiltonian ones

DOI10.1016/0167-8191(95)00007-0zbMath0875.68711OpenAlexW2052379151MaRDI QIDQ1352030

Lin Chen

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

zbMATH Keywords

Parallel algorithmsHamiltonian graphsBipartite permutation graphsGraph partitionTime and processor requirements

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

The cardinality constrained covering traveling salesman problem

This page was built for publication: Partitioning graphs into Hamiltonian ones