Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.
Hajo BroersmaJirí FialaPetr A. GolovachTomás KaiserDaniël PaulusmaAndrzej ProskurowskiPublished in: J. Graph Theory (2015)
Keyphrases
- computational complexity
- small number
- graph theory
- polynomial time complexity
- worst case
- times faster
- execution times
- random graphs
- computational cost
- memory requirements
- significant improvement
- computationally efficient
- weighted graph
- space complexity
- edge weights
- data structure
- theoretical analysis
- learning algorithm
- np complete
- undirected graph