Advances on the Hamiltonian Completion Problem

Authors:
S. E. Goodman;S. T. Hedetniemi;P. J. Slater
Affiliations:
Department of Applied Mathematics and Computer Science, University of Virginia, Charlottesville, VA;Department of Applied Mathematics and Computer Science, University of Virginia, Charlottesville, VA;National Bureau of Standards, Washington, DC and University of Iowa, Iowa City, Iowa
Venue:
Journal of the ACM (JACM)
Year:
1975

Citing 0
Cited 7

An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs

CSC '93 Proceedings of the 1993 ACM conference on Computer science
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus

Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Hamiltonian completions of sparse random graphs

Discrete Applied Mathematics
The approximability of the weighted Hamiltonian path completion problem on a tree

Theoretical Computer Science
Hamiltonian completions of sparse random graphs

Discrete Applied Mathematics
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract