Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs.
Andreas BrandstädtPavel FicurArne LeitertMartin MilanicPublished in: CoRR (2014)
Keyphrases
- polynomial time complexity
- np complete
- optimization problems
- graph isomorphism
- graph theory
- computationally efficient
- benchmark problems
- computational complexity
- graph matching
- planar graphs
- computationally expensive
- computational problems
- graph databases
- graph mining
- bounded treewidth
- decision problems
- massive graphs
- graph theoretic
- random graphs
- learning algorithm
- undirected graph
- weighted graph
- graph structure
- combinatorial optimization
- worst case
- data structure
- graph partitioning
- edge weights
- graph data
- graph construction
- linear space
- series parallel
- approximation algorithms
- maximum weight
- maximum clique