Clustering and domination in perfect graphs
From MaRDI portal
Publication:1068110
DOI10.1016/0166-218X(84)90088-XzbMath0581.05053MaRDI QIDQ1068110
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
algorithms; bipartite graphs; chordal graphs; cographs; split graphs; NP completeness; comparability graphs; k-cluster problem; k-dominating set problem; k-trees
Related Items
Dominating sets in perfect graphs, Permutation graphs: Connected domination and Steiner trees, An optimal algorithm for finding dominating cycles in circular-arc graphs, The complexity of domination problems in circle graphs