Fast and simple algorithms to count the number of vertex covers in an interval graph.

Published in: Inf. Process. Lett. (2007)

Keyphrases

edge weights
computational complexity
graph theory
data structure
significant improvement
small number
directed graph
memory requirements
undirected graph
graph search
data mining
random graphs
minimum spanning tree
space complexity
computational cost
theoretical analysis
search algorithm
learning algorithm