{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:34Z","timestamp":1725488974988},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_21","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T03:29:48Z","timestamp":1187062188000},"page":"218-227","source":"Crossref","is-referenced-by-count":3,"title":["Small Alliances in Graphs"],"prefix":"10.1007","author":[{"given":"Rodolfo","family":"Carvajal","sequence":"first","affiliation":[]},{"given":"Mart\u00edn","family":"Matamala","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Rapaport","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Schabanel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u201csmall-world\u201d networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"5","key":"21_CR2","doi-asserted-by":"publisher","first-page":"57101","DOI":"10.1103\/PhysRevE.71.057101","volume":"71","author":"S.N. Soffer","year":"2005","unstructured":"Soffer, S.N., Vazquez, A.: Network clustering coefficient without degree-correlation biases. Phys. Rev. E\u00a071(5), 57101 (2005)","journal-title":"Phys. Rev. E"},{"key":"21_CR3","unstructured":"Abdo, A.H., de Moura, A.P.S.: Measuring the local topology of networks: An extended clustering coefficient, arXiv:physics\/0605235 (2006)"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1140\/epjb\/e2004-00020-6","volume":"38","author":"G. Caldarelli","year":"2004","unstructured":"Caldarelli, G., Pastor-Santorras, R., Vespignani, A.: Cycles structure and local ordering in complex networks. The European Physical Journal B - Condensed Matter\u00a038(2), 183\u2013186 (2004)","journal-title":"The European Physical Journal B - Condensed Matter"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1140\/epjb\/e2004-00364-9","volume":"42","author":"J. Buhl","year":"2004","unstructured":"Buhl, J., Gautrais, J., Sol\u00e9, R.V., Kuntz, P., Valverde, S., Deneubourg, J., Theraulaz, G.: Efficiency and robustness in ant networks of galleries. The European Physical Journal B - Condensed Matter\u00a042, 123\u2013129 (2004)","journal-title":"The European Physical Journal B - Condensed Matter"},{"issue":"2","key":"21_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.7155\/jgaa.00108","volume":"9","author":"T. Schank","year":"2005","unstructured":"Schank, T., Wagner, D.: Approximating clustering coefficient and transitivity. Journal of Graph Algorithms and Applications\u00a09(2), 265\u2013275 (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/S0378-4371(02)01336-5","volume":"316","author":"A. Fronczak","year":"2002","unstructured":"Fronczak, A., Holyst, J.A., Jedynak, M., Sienkiewicz, J.: Higher order clustering coefficients in Barabasi-Albert networks. Physica A\u00a0316(1), 688\u2013694 (2002)","journal-title":"Physica A"},{"issue":"19","key":"21_CR8","doi-asserted-by":"publisher","first-page":"198701","DOI":"10.1103\/PhysRevLett.87.198701","volume":"87","author":"V. Latora","year":"2001","unstructured":"Latora, V., Marchiori, M.: Efficient behavior of small-world networks. Phys. Rev. Lett.\u00a087(19), 198701 (2001)","journal-title":"Phys. Rev. Lett."},{"key":"21_CR9","unstructured":"Kristiansen, P., Hedetniemi, S.M., Hedetniemi, S.T.: Alliances in graphs. J. Combin. Math. Combin. Comput. (48), 157\u2013177 (2004)"},{"key":"21_CR10","unstructured":"Shafique, K.H.: Partitioning a graph in alliances and its application to data clustering. PhD thesis, School of Comp. Sci., College of Eng. and Comp. Sci., University of Central Florida (2004)"},{"issue":"19","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1016\/j.aml.2006.02.001","volume":"12","author":"J.M. Sigarreta","year":"2006","unstructured":"Sigarreta, J.M., Rodr\u00edguez, J.A.: On defensive alliances and line graphs. Applied Mathematics Letters\u00a012(19), 1345\u20131350 (2006)","journal-title":"Applied Mathematics Letters"},{"issue":"2","key":"21_CR12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.7151\/dmgt.1230","volume":"24","author":"O. Favaron","year":"2004","unstructured":"Favaron, O., Fricke, G., Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T., Kristiansen, P.: Offensive alliances in graphs. Discuss. Math. Graph Theory\u00a024(2), 263\u2013275 (2004)","journal-title":"Discuss. Math. Graph Theory"},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.37236\/1740","volume":"10","author":"T.W. Haynes","year":"2003","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: Global defensive alliances in graphs. Electron. J. Combin\u00a0(10), 139\u2013146 (2003)","journal-title":"Electron. J. Combin"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.endm.2006.06.074","volume":"25","author":"J.A. Rodr\u00edguez","year":"2006","unstructured":"Rodr\u00edguez, J.A., Sigarreta, J.M.: Global offensive alliances in graphs. Electronic Notes in Discrete Mathematics\u00a025, 157\u2013164 (2006)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"21_CR15","first-page":"57","volume":"167","author":"R. Brigham","year":"2004","unstructured":"Brigham, R., Dutton, R., Hedetniemi, S.: A sharp lower bound on the powerful alliance number of c m \u00d7c n . Congr. Number.\u00a0167, 57\u201363 (2004)","journal-title":"Congr. Number."},{"key":"21_CR16","first-page":"139","volume":"162","author":"K.H. Shafique","year":"2003","unstructured":"Shafique, K.H., Dutton, R.D.: Maximum alliance-free and minimum alliance-cover sets. Congr. Number.\u00a0162, 139\u2013146 (2003)","journal-title":"Congr. Number."},{"key":"21_CR17","first-page":"139","volume":"56","author":"K.H. Shafique","year":"2006","unstructured":"Shafique, K.H., Dutton, R.D.: A tight bound on the cardinalities of maximum alliance-free and minimum alliance-cover sets. J. Combin. Math. Combin. Comput.\u00a056, 139\u2013145 (2006)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Vel\u00e1zquez, J.A., Gonzalez-Yero, I., Sigarreta, J.M.: Defensive k-alliances in graphs. eprint arXiv:math\/0611180 (2006)","DOI":"10.1016\/j.endm.2006.06.074"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Vel\u00e1zquez, J.A., Sigarreta, J.M.: Global defensive k-alliances in graphs. eprint arXiv:math\/0611616 (2006)","DOI":"10.12988\/imf.2006.06152"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1145\/347090.347121","volume-title":"Proc. of the 6th ACM SIGKDD Int. Conference on Knowledge Discovery and Data Mining","author":"G.W. Flake","year":"2000","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: Proc. of the 6th ACM SIGKDD Int. Conference on Knowledge Discovery and Data Mining, pp. 150\u2013160. ACM Press, New York (2000)"},{"issue":"2","key":"21_CR21","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(03)00261-0","volume":"137","author":"P. Flocchini","year":"2004","unstructured":"Flocchini, P., Lodi, E., Luccio, F., Pagli, L., Santoro, N.: Dynamic monopolies in tori. Discrete Appl. Math.\u00a0137(2), 197\u2013212 (2004)","journal-title":"Discrete Appl. Math."},{"key":"21_CR22","unstructured":"Bermond, J., Bond, J., Peleg, D., Perennes, S.: Tight bounds on the size of 2-monopolies. In: Proc. 3rd Colloq. on Structural Information and Communication Complexity (1996)"},{"issue":"2","key":"21_CR23","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0304-3975(01)00055-X","volume":"282","author":"D. Peleg","year":"2002","unstructured":"Peleg, D.: Local majorities, coalitions and monopolies in graphs: A review. Theor. Comput. Sci.\u00a0282(2), 231\u2013257 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"21_CR24","doi-asserted-by":"publisher","first-page":"36104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"M.E.J. Newman","year":"2006","unstructured":"Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E\u00a074(3), 36104 (2006)","journal-title":"Phys. Rev. E"},{"key":"21_CR25","unstructured":"McRae, A., Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T., Kristiansen, P.: The algorithmic complexity of alliances in graphs (Preprint, 2002)"},{"key":"21_CR26","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2004","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2004)"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Sipser, M.: Introduction to the Theory of Computation. International Thomson Publishing (1996)","DOI":"10.1145\/230514.571645"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:22:04Z","timestamp":1605745324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}