On the hardness of computing span of subcubic graphs.

Robert Janczewski Krzysztof Turowski

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

Keyphrases

graph matching
lower bound
worst case
phase transition
computational complexity
directed graph
graph theoretic
data sets
pattern recognition
np complete
weighted graph
graph model