Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.
Hajo BroersmaJirí FialaPetr A. GolovachTomás KaiserDaniël PaulusmaAndrzej ProskurowskiPublished in: WG (2013)
Keyphrases
- computational complexity
- graph theory
- polynomial time complexity
- small number
- memory requirements
- computationally efficient
- theoretical analysis
- times faster
- data structure
- run times
- execution times
- worst case
- learning algorithm
- orders of magnitude
- optimization problems
- graph theoretic
- computational cost
- computational problems
- maximal cliques
- evolutionary algorithm