Linear algorithm for domatic number problem on interval graphs
From MaRDI portal
Publication:1262139
DOI10.1016/0020-0190(89)90184-1zbMath0685.68062OpenAlexW9957747MaRDI QIDQ1262139
A. Srinivasa Rao, C. Pandu Rangan
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90184-1
Related Items (16)
Edge domatic numbers of complete \(n\)-partite graphs ⋮ Deferred-query—An efficient approach for problems on interval and circular-arc graphs ⋮ Transversal partitioning in balanced hypergraphs ⋮ Weighted independent perfect domination on cocomparability graphs ⋮ Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs ⋮ Loose cover of graphs ⋮ Linear algorithm for optimal path cover problem on interval graphs ⋮ On finding the minimum bandwidth of interval graphs ⋮ The upper domatic number of a graph ⋮ A simple linear time algorithm for the domatic partition problem on strongly chordal graphs ⋮ An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model ⋮ Generalized vertex covering in interval graphs ⋮ A tight bound on the number of mobile servers to guarantee transferability among dominating configurations ⋮ Common extremal graphs for three inequalities involving domination parameters ⋮ On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset ⋮ The domatic number problem on some perfect graph families
Cites Work
This page was built for publication: Linear algorithm for domatic number problem on interval graphs
