b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results.
Arti PandeyB. S. PandaPublished in: CALDAM (2016)
Keyphrases
- computational complexity
- experimental evaluation
- times faster
- detection algorithm
- preprocessing
- dynamic programming
- computational cost
- worst case
- high accuracy
- optimization algorithm
- cost function
- np hard
- randomly generated
- linear programming
- optimal solution
- objective function
- matching algorithm
- similarity measure
- graph structure
- social networks