{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:04:42Z","timestamp":1742911482977,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193144"},{"type":"electronic","value":"9783319193151"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_21","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"238-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Speeding up Graph Algorithms via Switching Classes"],"prefix":"10.1007","author":[{"given":"Nathan","family":"Lindzey","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"key":"21_CR1","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1090\/dimacs\/026\/03","volume-title":"Cliques, Colouring, and Satisfiability, Second DIMACS Implementations Challenge","author":"E Balas","year":"1996","unstructured":"Balas, E., Niehaus, W.: Finding large cliques in arbitrary graphs by bipartite matching. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Colouring, and Satisfiability, Second DIMACS Implementations Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 29\u201352. American Mathematical Society, Providence (1996)"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0095-8956(86)90075-4","volume":"40","author":"Y Cheng","year":"1986","unstructured":"Cheng, Y., Wells, A.L.: Switching classes of directed graphs. J. Comb. Theory, Ser. B 40(2), 169\u2013186 (1986). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0095895686900754","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"6","key":"21_CR3","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BF01940880","volume":"15","author":"J Cheriyan","year":"1996","unstructured":"Cheriyan, J., Mehlhorn, K.: Algorithms for dense graphs and networks on the random access computer. Algorithmica 15(6), 521\u2013549 (1996)","journal-title":"Algorithmica"},{"issue":"1","key":"21_CR4","first-page":"147","volume":"5","author":"E Dahlhaus","year":"2002","unstructured":"Dahlhaus, E., Gustedt, J., McConnell, R.M.: Partially complemented representations of digraphs. Discrete Math. Theor. Comput. Sci. 5(1), 147\u2013168 (2002)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965). http:\/\/dx.doi.org\/10.4153\/CJM-1965-045-4","journal-title":"Can. J. Math."},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1006\/jcss.1995.1065","volume":"51","author":"T Feder","year":"1995","unstructured":"Feder, T., Motwani, R.: Clique partitions, graph compression and speeding-up algorithms. J. Comput. Syst. Sci. 51(2), 261\u2013272 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1145\/115234.115366","volume":"38","author":"HN Gabow","year":"1991","unstructured":"Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph-matching problems. J. ACM 38(4), 815\u2013853 (1991)","journal-title":"J. ACM"},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n$$^{\\text{5\/2 }}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"21_CR9","first-page":"19","volume":"13","author":"E Jel\u00ednkov\u00e1","year":"2011","unstructured":"Jel\u00ednkov\u00e1, E., Such\u00fd, O., Hlinen\u00fd, P., Kratochv\u00edl, J.: Parameterized problems related to seidel\u2019s switching. Discrete Math. Theor. Comput. Sci. 13(2), 19\u201344 (2011)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"21_CR10","unstructured":"Joeris, B., Lindzey, N., McConnell, R.M., Osheim, N.: Simple DFS on the complement of a graph and on partially complemented digraphs. Inf. Process. Lett., arxiv.org (2013, submitted)"},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1009720402326","volume":"2","author":"MY Kao","year":"1998","unstructured":"Kao, M.Y., Occhiogrosso, N., Teng, S.H.: Simple and efficient graph compression schemes for dense and complement graphs. J. Comb. Optim. 2(4), 351\u2013359 (1998)","journal-title":"J. Comb. Optim."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Karpinski, M., Schudy, W.: Linear time approximation schemes for the gale-berlekamp game and related minimization problems. In: STOC, pp. 313\u2013322 (2009)","DOI":"10.1145\/1536414.1536458"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-63246-8_11","volume-title":"Structures in Logic and Computer Science","author":"RM McConnell","year":"1997","unstructured":"McConnell, R.M.: Complement-equivalence classes on graphs. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 174\u2013191. Springer, Heidelberg (1997)"},{"issue":"1\u20133","key":"21_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"RM McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.: Modular decomposition and transitive orientation. Discrete Math. 201(1\u20133), 189\u2013241 (1999)","journal-title":"Discrete Math."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An o(sqrt(n) m) algorithm for finding maximum matching in general graphs. In: FOCS, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1109\/TIT.2007.915716","volume":"54","author":"RM Roth","year":"2008","unstructured":"Roth, R.M., Viswanathan, K.: On the hardness of decoding the gale-berlekamp code. IEEE Trans. Inf. Theory 54(3), 1050\u20131060 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR17","unstructured":"Seidel, J.J.: A survey of two-graphs. In: Colloquio Internazionale sulle Teorie Combinatorie, pp. 481\u2013511 (1976)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:33:00Z","timestamp":1676943180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}