Hamiltonian Properties of the Lexicographic Product of Undirected Graphs.

Hanns-Martin Teichert

Published in: J. Inf. Process. Cybern. (1983)

Keyphrases

undirected graph
approximation algorithms
directed graph
directed acyclic graph
connected components
minimum cost
disjoint paths
computational complexity
np hard