{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:24Z","timestamp":1725516804748},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_42","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"425-433","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction"],"prefix":"10.1007","author":[{"given":"Masaya","family":"Mito","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Fujita","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"42_CR1","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":"42_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0166-218X(85)90025-3","volume":"12","author":"M.A. Bonuccelli","year":"1985","unstructured":"Bonuccelli, M.A.: Dominating Sets and Domatic Number of Circular Arc Graphs. Discrete Applied Mathematics\u00a012, 203\u2013213 (1985)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"42_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s11276-005-6615-6","volume":"11","author":"M. CardeiM","year":"2005","unstructured":"CardeiM, M., Du, D.-Z.: Improving Wireless Sensor Network Lifetime through Power Aware Organization. ACM Wireless Networks\u00a011(3), 333\u2013340 (2005)","journal-title":"ACM Wireless Networks"},{"issue":"1","key":"42_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R. Cole","year":"2001","unstructured":"Cole, R., Ost, K., Schirra, S.: Edge-Coloring Bipartite Multigraphs in O(E logD) Time. Combinatorica\u00a021(1), 5\u201312 (2001)","journal-title":"Combinatorica"},{"issue":"10","key":"42_CR5","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"},{"key":"42_CR6","unstructured":"Dong, Q.: Maximizing System Lifetime in Wireless Sensor Networks. In: Proc. of the 4th International Symposium on Information Processing in Sensor Networks, pp. 13\u201319 (2005)"},{"key":"42_CR7","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":"42_CR8","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"},{"issue":"13-14","key":"42_CR9","doi-asserted-by":"publisher","first-page":"2469","DOI":"10.1016\/j.comcom.2006.02.009","volume":"29","author":"R.W. Ha","year":"2006","unstructured":"Ha, R.W., Ho, P.H., Shen, X., Zhang, J.: Sleep Scheduling for Wireless Sensor Networks via Network Flow Model. Computer Communications\u00a029(13-14), 2469\u20132481 (2006)","journal-title":"Computer Communications"},{"issue":"1","key":"42_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1013770108453","volume":"51","author":"B.L. Hartnell","year":"2001","unstructured":"Hartnell, B.L., Rall, D.F.: Connected Domatic Number in Planar Graphs. Czechoslovak Mathematical Journal\u00a051(1), 173\u2013179 (2001)","journal-title":"Czechoslovak Mathematical Journal"},{"key":"42_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":"42_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":"42_CR13","first-page":"209","volume-title":"Graph Theory and Combinatorics","author":"S. Hedetniemi","year":"1984","unstructured":"Hedetniemi, S., Laskar, R.: Connected domination in Graphs. In: Graph Theory and Combinatorics, pp. 209\u2013218. Academic Press, London (1984)"},{"key":"42_CR14","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":"42_CR15","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":"42_CR16","first-page":"387","volume":"36","author":"B. Zelinka","year":"1986","unstructured":"Zelinka, B.: Connected Domatic Number of a Graph. Math. Slovaca\u00a036, 387\u2013392 (1986)","journal-title":"Math. Slovaca"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:44:53Z","timestamp":1620017093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}