Polynomial Algorithms for the Weighted Perfect Domination Problems on Chordal Graphs and Split Graphs.
Maw-Shang ChangYi-Chang LiuPublished in: Inf. Process. Lett. (1993)
Keyphrases
- graph theory
- optimization problems
- representational power
- graph layout
- polynomial time complexity
- series parallel
- graph model
- weighted graph
- benchmark problems
- graph matching
- max cut
- learning algorithm
- data structure
- massive graphs
- random graphs
- edge weights
- graph theoretic
- graphical models
- bipartite graph
- graph databases
- adjacency matrix
- search algorithm
- worst case
- np complete
- graph isomorphism
- minimum cost flow
- combinatorial optimization
- search methods
- graph structures
- computational problems
- cutting plane
- minimum spanning tree
- partial solutions
- graph structure
- graph mining