{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:15:31Z","timestamp":1743066931313,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382352"},{"type":"electronic","value":"9783642382369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38236-9_30","type":"book-chapter","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T02:38:02Z","timestamp":1365993482000},"page":"331-342","source":"Crossref","is-referenced-by-count":0,"title":["Vector Connectivity in Graphs"],"prefix":"10.1007","author":[{"given":"Endre","family":"Boros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pim","family":"van \u2019t Hof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","volume":"206","author":"M. Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkova, J.: Approximation hardness of dominating set problems in bounded degree graphs. Information and Computation\u00a0206, 1264\u20131275 (2008)","journal-title":"Information and Computation"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N. Chen","year":"2009","unstructured":"Chen, N.: On the approximability of inuence in social networks. SIAM Journal on Discrete Mathematics\u00a023, 1400\u20131415 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Cicalese, F., Milani\u010d, M., Vaccaro, U.: On the approximability and exact algorithms for vector domination and related problems in graphs. Discrete Applied Mathematics (2012), doi:10.1016\/j.dam.2012.10.007","DOI":"10.1007\/978-3-642-22953-4_25"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput.\u00a014, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"30_CR6","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H.\u00a0Freeman and Co., New York (1979)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Annals of Discrete Mathematics, vol.\u00a057. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2004.01.011","volume":"145","author":"M. Habib","year":"2005","unstructured":"Habib, M., Paul, C.: A simple linear time algorithm for cograph recognition. Discrete Applied Mathematics\u00a0145, 183\u2013197 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579333","volume":"1","author":"P.L. Hammer","year":"1981","unstructured":"Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica\u00a01, 275\u2013284 (1981)","journal-title":"Combinatorica"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1017\/S0963548399004034","volume":"8","author":"J. Harant","year":"1999","unstructured":"Harant, J., Prochnewski, A., Voigt, M.: On dominating sets and independent sets of graphs. Combinatorics, Probability and Computing\u00a08, 547\u2013553 (1999)","journal-title":"Combinatorics, Probability and Computing"},{"key":"30_CR11","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of inuence through a social network. In: Proc. 9th ACM KDD, pp. 137\u2013146. ACM Press (2003)","DOI":"10.1145\/956750.956769"},{"key":"30_CR14","unstructured":"Mahadev, N., Peled, U.: Threshold graphs and related topics. Annals of Discrete Mathematics\u00a056 (1995)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Nichterlein, A., Niedermeier, R., Uhlmann, J., Weller, M.: On tractable cases of target set selection. Social Network Analysis and Mining (2012)","DOI":"10.1007\/s13278-012-0067-7"},{"key":"30_CR16","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization. Polyhedra and Efficiency. Volumes A\u2013C","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency. Volumes A\u2013C. Algorithms and Combinatorics, vol.\u00a024. Springer, Berlin (2003)"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"L.A. Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica\u00a02, 385\u2013393 (1982)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38236-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T01:28:15Z","timestamp":1675214895000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38236-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382352","9783642382369"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38236-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}