Liar's domination in graphs: Complexity and algorithm.
B. S. PandaSubhabrata PaulPublished in: Discret. Appl. Math. (2013)
Keyphrases
- computational complexity
- space complexity
- experimental evaluation
- dynamic programming
- computational cost
- matching algorithm
- graph structure
- learning algorithm
- expectation maximization
- convergence rate
- times faster
- detection algorithm
- graph isomorphism
- worst case
- optimal solution
- linear complexity
- clustering method
- probabilistic model
- polynomial time complexity
- k means
- optimization algorithm
- graph clustering
- maximum common subgraph
- weighted graph
- memory requirements
- segmentation algorithm
- theoretical analysis
- np hard
- similarity measure