Login / Signup
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Hajo Broersma
Jirí Fiala
Petr A. Golovach
Tomás Kaiser
Daniël Paulusma
Andrzej Proskurowski
Published in:
CoRR (2013)
Keyphrases
</>
computational complexity
computational cost
small number
orders of magnitude
learning algorithm
memory requirements
graph theory
execution times
polynomial time complexity
worst case
random graphs
data structure
significant improvement
np complete
computationally efficient
theoretical analysis