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