{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:40:38Z","timestamp":1725896438127},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_36","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"368-379","source":"Crossref","is-referenced-by-count":6,"title":["An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs"],"prefix":"10.1007","author":[{"given":"Evaggelos","family":"Lappas","sequence":"first","affiliation":[]},{"given":"Stavros D.","family":"Nikolopoulos","sequence":"additional","affiliation":[]},{"given":"Leonidas","family":"Palios","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(88)90064-9","volume":"21","author":"M.J. Atallah","year":"1988","unstructured":"Atallah, M.J., Manacher, G.K., Urrutia, J.: Finding a minimum independent dominating set in a permutation graph. Discrete Appl. Math.\u00a021, 177\u2013183 (1988)","journal-title":"Discrete Appl. Math."},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(87)90128-9","volume":"54","author":"A. Brandstadt","year":"1987","unstructured":"Brandstadt, A., Kratsch, D.: On domination problems for permutation and other graphs. Theoret. Comput. Sci.\u00a054, 181\u2013198 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.endm.2005.06.059","volume":"22","author":"B. Bre\u0161ar","year":"2005","unstructured":"Bre\u0161ar, B., Henning, M.A., Rall, D.F.: Paired-domination of Cartesian products of graphs and rainbow domination. Electr. Notes in Discrete Math.\u00a022, 233\u2013237 (2005)","journal-title":"Electr. Notes in Discrete Math."},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0166-218X(98)00145-0","volume":"102","author":"H.S. Chao","year":"2000","unstructured":"Chao, H.S., Hsu, F.R., Lee, R.C.T.: An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs. Discrete Appl. Math.\u00a0102, 159\u2013173 (2000)","journal-title":"Discrete Appl. Math."},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.1016\/j.dam.2007.05.011","volume":"155","author":"T.C.E. Cheng","year":"2007","unstructured":"Cheng, T.C.E., Kang, L.Y., Ng, C.T.: Paired domination on interval and circular-arc graphs. Discrete Appl. Math.\u00a0155, 2077\u20132086 (2007)","journal-title":"Discrete Appl. Math."},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.dam.2008.02.015","volume":"157","author":"T.C.E. Cheng","year":"2009","unstructured":"Cheng, T.C.E., Kang, L., Shan, E.: A polynomial-time algorithm for the paired-domination problem on permutation graphs. Discrete Appl. Math.\u00a0157, 262\u2013271 (2009)","journal-title":"Discrete Appl. Math."},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-006-9022-8","volume":"14","author":"P. Dorbec","year":"2007","unstructured":"Dorbec, P., Gravier, S., Henning, M.A.: Paired-domination in generalized claw-free graphs. J. Comb. Optim.\u00a014, 1\u20137 (2007)","journal-title":"J. Comb. Optim."},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","volume":"6","author":"M. Farber","year":"1985","unstructured":"Farber, M., Keil, J.M.: Domination in permutation graphs. J.\u00a0Algorithms\u00a06, 309\u2013321 (1985)","journal-title":"J.\u00a0Algorithms"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s00373-004-0577-9","volume":"20","author":"O. Favaron","year":"2004","unstructured":"Favaron, O., Henning, M.A.: Paired-domination in claw-free cubic graphs. Graphs and Combinatorics\u00a020, 447\u2013456 (2004)","journal-title":"Graphs and Combinatorics"},{"key":"36_CR10","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, Inc., New York (1980)"},{"key":"36_CR11","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"36_CR12","volume-title":"Domination in Graphs: Advanced Topics","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F","volume":"32","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Slater, P.J.: Paired-domination in graphs. Networks\u00a032, 199\u2013206 (1998)","journal-title":"Networks"},{"key":"36_CR14","series-title":"Ann. Discrete Math.","volume-title":"Topics on Domination","year":"1991","unstructured":"Hedetniemi, S.T., Laskar, R. (eds.): Topics on Domination. Ann. Discrete Math., vol.\u00a048. North-Holland, Amsterdam (1991)"},{"key":"36_CR15","first-page":"93","volume":"7","author":"D. Helmbold","year":"1990","unstructured":"Helmbold, D., Mayr, E.W.: Applications of parallel algorithms to families of perfect graphs. Computing\u00a07, 93\u2013107 (1990)","journal-title":"Computing"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10878-005-4107-3","volume":"10","author":"M.A. Henning","year":"2005","unstructured":"Henning, M.A., Plummer, M.D.: Vertices contained in all or in no minimum paired-dominating set of a tree. J. Comb. Optim.\u00a010, 283\u2013294 (2005)","journal-title":"J. Comb. Optim."},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.tcs.2004.02.028","volume":"320","author":"L. Kang","year":"2004","unstructured":"Kang, L., Sohn, M.Y., Cheng, T.C.E.: Paired-domination in inflated graphs. Theor. Comput. Sci.\u00a0320, 485\u2013494 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR18","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0166-218X(01)00198-6","volume":"119","author":"C.L. Lu","year":"2002","unstructured":"Lu, C.L., Ko, M.-T., Tang, C.Y.: Perfect edge domination and efficient edge domination in graphs. Discrete Appl. Math.\u00a0119, 227\u2013250 (2002)","journal-title":"Discrete Appl. Math."},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Math.\u00a0201, 189\u2013241 (1999)","journal-title":"Discrete Math."},{"key":"36_CR20","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0166-218X(01)00289-X","volume":"120","author":"S.D. Nikolopoulos","year":"2002","unstructured":"Nikolopoulos, S.D.: Coloring permutation graphs in parallel. Discrete Appl. Math.\u00a0120, 165\u2013195 (2002)","journal-title":"Discrete Appl. Math."},{"key":"36_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0020-0190(00)00109-5","volume":"75","author":"S.D. Nikolopoulos","year":"2000","unstructured":"Nikolopoulos, S.D., Papadopoulos, C.: On the performance of the First-Fit coloring algorithm on permutation graphs. Inform. Process. Lett.\u00a075, 265\u2013273 (2000)","journal-title":"Inform. Process. Lett."},{"key":"36_CR22","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","volume":"23","author":"A. Pnueli","year":"1971","unstructured":"Pnueli, A., Lempel, A., Even, S.: Transitive orientation of graphs and identification of permutation graphs. Canadian J.\u00a0Math.\u00a023, 160\u2013175 (1971)","journal-title":"Canadian J.\u00a0Math."},{"key":"36_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1021338214295","volume":"25","author":"H. Qiao","year":"2003","unstructured":"Qiao, H., Kang, L., Gardei, M., Du, D.-Z.: Paired-domination of trees. J.\u00a0of Global Optimization\u00a025, 43\u201354 (2003)","journal-title":"J.\u00a0of Global Optimization"},{"volume-title":"Synthesis of Parallel Algorithms","year":"1993","key":"36_CR24","unstructured":"Reif, J. (ed.): Synthesis of Parallel Algorithms. Morgan Kaufmann Publishers, Inc., San Mateo (1993)"},{"key":"36_CR25","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1137\/S0097539794200383","volume":"25","author":"C. Rhee","year":"1996","unstructured":"Rhee, C., Liang, Y.D., Dhall, S.K., Lakshmivarahan, S.: An O(n\u2009+\u2009m)-time algorithm for finding a minimum-weight dominating set in a permutation graph. SIAM J.\u00a0Comput.\u00a025, 404\u2013419 (1996)","journal-title":"SIAM J.\u00a0Comput."},{"key":"36_CR26","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/0214048","volume":"14","author":"J. Spinrad","year":"1985","unstructured":"Spinrad, J.: On comparability and permutation graphs. SIAM J.\u00a0Comput.\u00a014, 658\u2013670 (1985)","journal-title":"SIAM J.\u00a0Comput."},{"key":"36_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0020-0190(95)94093-8","volume":"56","author":"A. Srinivasan","year":"1995","unstructured":"Srinivasan, A., Madhukar, K., Nagavamsi, P., Rangan, C.P., Chang, M.-S.: Edge domination on bipartite permutation graphs and cotriangulated graphs. Inform. Process. Lett.\u00a056, 165\u2013171 (1995)","journal-title":"Inform. Process. Lett."},{"key":"36_CR28","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(85)90093-6","volume":"21","author":"K.J. Supowit","year":"1985","unstructured":"Supowit, K.J.: Decomposing a set of points into chains, with applications to permutation and circle graphs. Inform. Process. Lett.\u00a021, 249\u2013252 (1985)","journal-title":"Inform. Process. Lett."},{"key":"36_CR29","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/BF01190158","volume":"9","author":"K.H. Tsai","year":"1993","unstructured":"Tsai, K.H., Hsu, W.L.: Fast algorithms for the dominating set problem on permutation graphs. Algorithmica\u00a09, 601\u2013614 (1993)","journal-title":"Algorithmica"},{"key":"36_CR30","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M. Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge domination sets in graphs. SIAM J.\u00a0Appl.\u00a0Math.\u00a038, 364\u2013372 (1980)","journal-title":"SIAM J.\u00a0Appl.\u00a0Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:34:34Z","timestamp":1619782474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}