Abstract
Let m and n be the number of edges and vertices in a graph. We use a greedy method to design an O( m+ n) time algorithm to partition the vertex set of a strongly chordal graph into δ + 1 disjoint dominating sets, where δ is the minimum degree of the graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
