{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:58:38Z","timestamp":1725893918397},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540778905"},{"type":"electronic","value":"9783540778912"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77891-2_1","type":"book-chapter","created":{"date-parts":[[2008,1,12]],"date-time":"2008-01-12T03:19:36Z","timestamp":1200107976000},"page":"1-12","source":"Crossref","is-referenced-by-count":1,"title":["Vertex Domination in Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_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.\u00a0Math.\u00a021, 177\u2013183 (1988)","journal-title":"Discrete Appl.\u00a0Math."},{"key":"1_CR2","unstructured":"Bange, D.W., Barkauskas, A.E., Slater, P.T.: Efficient dominating sets in graphs. In: Ringeisen, R.D., Roberts, F.S. (eds.) Applications of Discrete Mathematics, pp. 189\u2013199. SIAM (1988)"},{"issue":"6","key":"1_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0020-0190(88)90173-1","volume":"28","author":"A.A. Bertossi","year":"1988","unstructured":"Bertossi, A.A.: On the domatic number of interval graphs. Information Processing Letters\u00a028(6), 275\u2013280 (1988)","journal-title":"Information Processing Letters"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Chang, G.J., Rangan, C.P., Coorg, S.R.: Weighted independent perfect domination on cocomparability graphs. Technical Report 93-24, DIMACS (April 1993)","DOI":"10.1007\/3-540-57568-5_282"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1109\/TCS.1975.1083994","volume":"22","author":"E.J. Cockayne","year":"1975","unstructured":"Cockayne, E.J., Hedetniemi, S.T.: Optimal domination in graphs. IEEE Trans. Circuit and Systems\u00a0 CAS-22, 855\u2013857 (1975)","journal-title":"IEEE Trans. Circuit and Systems"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230070305","volume":"7","author":"E.J. Cockayne","year":"1977","unstructured":"Cockayne, E.J., Hedetniemi, S.T.: Towards a theory of domination in graphs. Networks\u00a07, 247\u2013261 (1977)","journal-title":"Networks"},{"issue":"10","key":"1_CR7","first-page":"1343","volume":"53","author":"F. Dai","year":"2004","unstructured":"Dai, F., Wu, J.: An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks. IEEE Transactions on Parallel and Distributed Systems\u00a053(10), 1343\u20131354 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"11","key":"1_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilization in spite of distributed control. Communications of the ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0895480196311328","volume":"13","author":"S. Fujita","year":"2000","unstructured":"Fujita, S., Yamashita, M., Kameda, T.: A Study on r-Configurations \u2013 A Resource Assignment Problem on Graphs. SIAM J. Discrete Math.\u00a013(2), 227\u2013254 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","first-page":"326","volume-title":"Parallel and Distributed Computing: Applications and Technologies","author":"S. Fujita","year":"2004","unstructured":"Fujita, S., Liang, Y.: How to Provide Continuous Services by Mobile Servers in Communication Networks. In: Liew, K.-M., Shen, H., See, S., Cai, W. (eds.) PDCAT 2004. LNCS, vol.\u00a03320, pp. 326\u2013329. Springer, Heidelberg (2004)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/11602613_57","volume-title":"Algorithms and Computation","author":"S. Fujita","year":"2005","unstructured":"Fujita, S.: A Tight Bound on the Number of Mobile Servers to Guarantee the Mutual Transferability among Dominating Configurations. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 563\u2013572. Springer, Heidelberg (2005)"},{"key":"1_CR12","unstructured":"Fujita, S.: Loose Covering by Graphs. In: Proc. of 2006 Japan-Korea Joint Workshop on Algorithms and Computation, pp. 9\u201315 (2006)"},{"key":"1_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Guha, S., Khuller, S.: Approximation Algorithms for Connected Dominating Sets. In: Proc. European Symposium on Algorithms, pp. 179\u2013193 (1996)","DOI":"10.1007\/3-540-61680-2_55"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, Inc. (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, Inc. (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0020-0190(91)90188-N","volume":"37","author":"R.W. Irving","year":"1991","unstructured":"Irving, R.W.: On approximating the minimum independent dominating set. Information Processing Letters\u00a037, 197\u2013200 (1991)","journal-title":"Information Processing Letters"},{"key":"1_CR18","first-page":"187","volume":"79","author":"M. Livingston","year":"1990","unstructured":"Livingston, M., Stout, Q.F.: Perfect dominating sets. Congressus Numerantium\u00a079, 187\u2013203 (1990)","journal-title":"Congressus Numerantium"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/0403045","volume":"3","author":"T.L. Lu","year":"1990","unstructured":"Lu, T.L., Ho, P.H., Chang, G.J.: The domatic number problem in interval graphs. SIAM J. Disc. Math.\u00a03, 531\u2013536 (1990)","journal-title":"SIAM J. Disc. Math."},{"key":"1_CR20","unstructured":"Matheson, L.R., Tarjan, R.E.: Dominating sets in planar graphs. Technical Report TR-461-94, Dept. of Computer Science, Princeton University (May 1994)"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0020-0190(89)90184-1","volume":"33","author":"A.S. Rao","year":"1989","unstructured":"Rao, A.S., Rangan, C.P.: Linear algorithm for domatic number problem on interval graphs. Information Processing Letters\u00a033(1), 29\u201333 (1989)","journal-title":"Information Processing Letters"},{"key":"1_CR22","unstructured":"Wu, J., Li, H.: Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links. In: Proc. of International Conference on Parallel Processing, pp. 189\u2013200 (2000)"},{"key":"1_CR23","first-page":"327","volume":"22","author":"J. Wu","year":"2002","unstructured":"Wu, J.: Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links. IEEE Transactions on Parallel and Distributed Computing\u00a022, 327\u2013340 (2002)","journal-title":"IEEE Transactions on Parallel and Distributed Computing"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0020-0190(90)90031-R","volume":"35","author":"C.C. Yen","year":"1990","unstructured":"Yen, C.C., Lee, R.C.T.: The weighted perfect domination problem. Information Processing Letters\u00a035, 295\u2013299 (1990)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77891-2_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T16:11:01Z","timestamp":1684167061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77891-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540778905","9783540778912"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77891-2_1","relation":{},"subject":[]}}