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
Unnamed Item, An O(\(n\)) time algorithm for maximum matching on cographs, 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, Weighted connected domination and Steiner trees in distance-hereditary graphs, Partial and perfect path covers of cographs, On the algorithmic complexity of twelve covering and independence parameters of graphs, A linear time algorithm for the maximum matching problem on cographs, On cocolourings and cochromatic numbers of graphs, Well-covered graphs and extendability, On semi-\(P_ 4\)-sparse graphs, A new upper bound for the 0-1 quadratic knapsack problem, Domination and total domination on asteroidal triple-free graphs