Improved Algorithms and Complexity Results for Power Domination in Graphs.
Jiong GuoRolf NiedermeierDaniel RaiblePublished in: Algorithmica (2008)
Keyphrases
- computational complexity
- computational cost
- worst case
- learning algorithm
- significant improvement
- theoretical analysis
- graph theory
- data structure
- computationally efficient
- orders of magnitude
- high computational complexity
- benchmark datasets
- times faster
- memory requirements
- space complexity
- complexity analysis
- graph data
- random graphs
- graphical models
- representational power