Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs.
Andreas BrandstädtPavel FicurArne LeitertMartin MilanicPublished in: Inf. Process. Lett. (2015)
Keyphrases
- polynomial time complexity
- np complete
- graph theory
- graph isomorphism
- optimization problems
- planar graphs
- computationally expensive
- combinatorial optimization
- benchmark problems
- efficient solutions
- computational complexity
- graph layout
- graph mining
- maximum clique
- computationally efficient
- learning algorithm
- graph data
- weighted graph
- edge weights
- graph construction
- worst case
- massive graphs
- computational problems
- computationally hard
- graph matching
- directed graph
- special case
- graph mining algorithms