Publication:3171770
From MaRDI portal
zbMath1229.68043MaRDI QIDQ3171770
Akul Rana, Anita Pal, Madhumangal Pal
Publication date: 5 October 2011
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
An efficient algorithm to solve the conditional covering problem on trapezoid graphs, Efficient algorithms for the conditional covering problem, The conditional covering problem on unweighted interval graphs with nonuniform coverage radius, Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs