Finding a minimum independent dominating set in a permutation graph

Abstract

We give an 0 (nlogln) [ime algorirnm for finding a minimum independem dominating se[ in a pennmation graph. TItis improves on ilie previous D(n 3) time algorictun known for solving tllis problem [4]. .,. Dept of CompUlcr Sci., Purdue Univ., West Gf:tyelle, IN 47907. Rcso::trch ~upported by ONR. Contr:lct NOOOI-l-34-K. 0502:md NSF Gl':tnl DCR-8451393, wilh matching funds from AT&T. • o.:pt of MaihCiT\:tllcs, Universily oflllinois, Chil;;lgo, II. 60614. + Dept of CompUler Science, University of Oll:twa, Oll.:l.w:t. Ont:tno, Cm:td:l..

DOI: 10.1016/0166-218X(88)90064-9

Extracted Key Phrases

Cite this paper

@article{Atallah1988FindingAM, title={Finding a minimum independent dominating set in a permutation graph}, author={Mikhail J. Atallah and Glenn K. Manacher and Jorge Urrutia}, journal={Discrete Applied Mathematics}, year={1988}, volume={21}, pages={177-183} }