{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:59:12Z","timestamp":1725465552886},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_23","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T12:57:16Z","timestamp":1368622636000},"page":"276-287","source":"Crossref","is-referenced-by-count":0,"title":["Cliques and Clubs"],"prefix":"10.1007","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arash","family":"Rafiey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Abello, J., Pardalos, P., Resende, M.: On maximum clique problems in very large graphs. In: External memory algorithms and visualization. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol.\u00a050, pp. 119\u2013130. AMS (1999)","DOI":"10.1090\/dimacs\/050\/06"},{"key":"23_CR2","unstructured":"Agnarsson, G., Greenlaw, R., Halld\u00f3rsson, M.M.: On powers of chordal graphs and their colorings. In: Proceedings of SICCGTC 2000, vol.\u00a0144, pp. 41\u201365 (2000)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"R. Alba","year":"1973","unstructured":"Alba, R.: A graph-theoretic definition of a sociometric clique. Journal of Mathematical Sociology\u00a03, 113\u2013126 (1973)","journal-title":"Journal of Mathematical Sociology"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-642-12200-2_53","volume-title":"LATIN 2010: Theoretical Informatics","author":"Y. Asahiro","year":"2010","unstructured":"Asahiro, Y., Miyano, E., Samizo, K.: Approximating maximum diameter-bounded subgraphs. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 615\u2013626. Springer, Heidelberg (2010)"},{"issue":"8","key":"23_CR5","first-page":"1062","volume":"12","author":"R. Balakrishnan","year":"1981","unstructured":"Balakrishnan, R., Paulraja, P.: Correction to: \u201cGraphs whose squares are chordal\u201d. Indian J. Pure Appl. Math.\u00a012(8), 1062 (1981)","journal-title":"Indian J. Pure Appl. Math."},{"issue":"2","key":"23_CR6","first-page":"193","volume":"12","author":"R. Balakrishnan","year":"1981","unstructured":"Balakrishnan, R., Paulraja, P.: Graphs whose squares are chordal. Indian J. Pure Appl. Math.\u00a012(2), 193\u2013194 (1981)","journal-title":"Indian J. Pure Appl. Math."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","volume":"10","author":"B. Balasundaram","year":"2005","unstructured":"Balasundaram, B., Butenko, S., Trukhanov, S.: Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization\u00a010, 23\u201339 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1-3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(94)00052-K","volume":"145","author":"H.J. Bandelt","year":"1995","unstructured":"Bandelt, H.J., Henkmann, A., Nicolai, F.: Powers of distance-hereditary graphs. Discrete Mathematics\u00a0145(1-3), 37\u201360 (1995)","journal-title":"Discrete Mathematics"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V., Spinrad, J.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/11785293_39","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Xiang, Y., Yan, C.: Generalized powers of graphs and their algorithmic use. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 423\u2013434. Springer, Heidelberg (2006)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Chandran, L.S., Mathew, R.: Bipartite powers of k-chordal graphs. arXiv:1108.0277 [math.CO] (2012)","DOI":"10.46298\/dmtcs.609"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Chang, J.M., Ho, C.W., Ko, M.T.: Powers of asteroidal triple-free graphs with applications. Ars Comb.\u00a067 (2003)","DOI":"10.1016\/S0166-218X(03)00390-1"},{"key":"23_CR13","unstructured":"Chang, M.S., Hung, L.J., Lin, C.R., Su, P.C.: Finding large k-clubs in undirected graphs. In: Proceedings of the 28th Workshop on Combinatorial Mathematics and Computation Theory, pp. 1\u201310 (2011)"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. of Math (2)\u00a0164(1), 51\u2013229 (2006)","journal-title":"Ann. of Math. (2)"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"D. Corneil","year":"1984","unstructured":"Corneil, D., Perl, Y.: Clustering and domination in perfect graphs. Discrete Applied Mathematics\u00a09, 27\u201339 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1006\/jagm.2001.1199","volume":"41","author":"M. Dawande","year":"2001","unstructured":"Dawande, M., Swaminathan, J., Keskinocak, P., Tayur, S.: On bipartite and multipartite clique problems. Journal of Algorithms\u00a041, 388\u2013403 (2001)","journal-title":"Journal of Algorithms"},{"key":"23_CR17","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph theory","author":"R. Diestel","year":"2010","unstructured":"Diestel, R.: Graph theory, 4th edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2010)","edition":"4"},{"key":"23_CR18","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)80059-1"},{"issue":"3","key":"23_CR19","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. Int. J. Found. Comput. Sci.\u00a011(3), 423\u2013443 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-33293-7_22","volume-title":"Parameterized and Exact Computation","author":"S. Hartung","year":"2012","unstructured":"Hartung, S., Komusiewicz, C., Nichterlein, A.: Parameterized algorithmics and computational experiments for finding 2-clubs. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol.\u00a07535, pp. 231\u2013241. Springer, Heidelberg (2012)"},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01788689","volume":"5","author":"R. Hayward","year":"1989","unstructured":"Hayward, R., Ho\u00e0ng, C.T., Maffray, F.: Optimizing weakly triangulated graphs. Graphs and Combinatorics\u00a05(1), 339\u2013349 (1989)","journal-title":"Graphs and Combinatorics"},{"key":"23_CR22","unstructured":"Hayward, R., Spinrad, J., Sritharan, R.: Weakly chordal graph algorithms via handles. In: Proceedings of SODA 2000, pp. 42\u201349 (2000)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Kloks, T., Kratsch, D.: Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph. Information Processing Letters\u00a055 (1995)","DOI":"10.1016\/0020-0190(95)00027-A"},{"key":"23_CR24","unstructured":"Lubiw, A.: \u0393-free matrices. Master thesis, Department of Combinatorics and Optimization, University of Waterloo (1982)"},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"R. Luce","year":"1950","unstructured":"Luce, R.: Connectivity and generalized cliques in sociometric group structure. Psychometrika\u00a015, 169\u2013190 (1950)","journal-title":"Psychometrika"},{"key":"23_CR26","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"R. Mokken","year":"1979","unstructured":"Mokken, R.: Cliques, clubs and clans. Quality and Quantity\u00a013, 161\u2013173 (1979)","journal-title":"Quality and Quantity"},{"issue":"2","key":"23_CR27","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.disopt.2012.02.002","volume":"9","author":"F.M. Pajouh","year":"2012","unstructured":"Pajouh, F.M., Balasundaram, B.: On inclusionwise maximal and maximum cardinality k-clubs in graphs. Discrete Optimization\u00a09(2), 84\u201397 (2012)","journal-title":"Discrete Optimization"},{"key":"23_CR28","first-page":"307","volume":"15","author":"S. Poljak","year":"1974","unstructured":"Poljak, S.: A note on stable sets and colorings of graphs. Comment. Math. Univ. Carolinae\u00a015, 307\u2013309 (1974)","journal-title":"Comment. Math. Univ. Carolinae"},{"key":"23_CR29","unstructured":"Sch\u00e4fer, A.: Exact algorithms for s-club finding and related problems (2009), diplomarbeit, Institut f\u00fcr Informatik, Friedrich-Schiller-Universit\u00e4t Jena"},{"issue":"5","key":"23_CR30","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s11590-011-0311-5","volume":"6","author":"A. Sch\u00e4fer","year":"2012","unstructured":"Sch\u00e4fer, A., Komusiewicz, C., Moser, H., Niedermeier, R.: Parameterized computational complexity of finding small-diameter subgraphs. Optimization Letters\u00a06(5), 883\u2013891 (2012)","journal-title":"Optimization Letters"},{"key":"23_CR31","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"S.B. Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph theoretic generalization of the clique concept. Journal of Mathematical Sociology\u00a06, 139\u2013154 (1978)","journal-title":"Journal of Mathematical Sociology"},{"issue":"3","key":"23_CR32","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput.\u00a013(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T02:45:39Z","timestamp":1645065939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}