{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:30:16Z","timestamp":1725456616107},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642346101"},{"type":"electronic","value":"9783642346118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34611-8_16","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T08:42:25Z","timestamp":1350895345000},"page":"138-147","source":"Crossref","is-referenced-by-count":4,"title":["On the Minimum Degree Up to Local Complementation: Bounds and Complexity"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me","family":"Javelle","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Mhalla","sequence":"additional","affiliation":[]},{"given":"Simon","family":"Perdrix","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"12319","DOI":"10.1103\/PhysRevA.71.012319","volume":"71","author":"H. Aschauer","year":"2005","unstructured":"Aschauer, H., Dur, W., Briegel, H.J.: Multiparticle entanglement purification for two-colorable graph states. Physical Review A\u00a071, 012319 (2005)","journal-title":"Physical Review A"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Beigi, S., Chuang, I., Grassl, M., Shor, P., Zeng, B.: Graph concatenation for quantum codes. Journal of Mathematical Physics\u00a052 (2011)","DOI":"10.1063\/1.3534799"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Fitzsimons, J., Kashefi, E.: Universal blind quantum computation. In: Proceedings of FOCS, pp. 517\u2013526 (2009)","DOI":"10.1109\/FOCS.2009.36"},{"issue":"7","key":"16_CR4","doi-asserted-by":"publisher","first-page":"3210","DOI":"10.1109\/TIT.2006.876244","volume":"52","author":"L.M.J. Bazzi","year":"2006","unstructured":"Bazzi, L.M.J., Mitter, S.K.: Some randomized code constructions from group actions. IEEE Transactions on Information Theory\u00a052(7), 3210\u20133219 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0608028","volume":"8","author":"A. Bouchet","year":"1987","unstructured":"Bouchet, A.: Digraph decompositions and eulerian systems. SIAM J. Algebraic Discrete Methods\u00a08, 323\u2013337 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Bouchet, A.: \u03ba-transformations, local complementations and switching. Cycles and Rays (1990)","DOI":"10.1007\/978-94-009-0517-7_5"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/jctb.1994.1008","volume":"60","author":"A. Bouchet","year":"1994","unstructured":"Bouchet, A.: Circle graph obstructions. J. Comb. Theory Ser. B\u00a060, 107\u2013144 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, Q., Wan, D.: A deterministic reduction for the gap minimum distance problem. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 33\u201338 (2009)","DOI":"10.1145\/1536414.1536421"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(81)90255-7","volume":"33","author":"H. Fraysseix de","year":"1981","unstructured":"de Fraysseix, H.: Local complementation and interlacement graphs. Discrete Mathematics\u00a033(1), 29\u201335 (1981)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/TIT.2002.806118","volume":"49","author":"I. Dumer","year":"1999","unstructured":"Dumer, I., Micciancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. IEEE Transactions on Information Theory\u00a049(1), 22\u201337 (1999); Preliminary version in FOCS 1999","journal-title":"IEEE Transactions on Information Theory"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/11940128_64","volume-title":"Algorithms and Computation","author":"P. H\u00f8yer","year":"2006","unstructured":"H\u00f8yer, P., Mhalla, M., Perdrix, S.: Resources Required for Preparing Graph States. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 638\u2013649. Springer, Heidelberg (2006)"},{"key":"16_CR12","unstructured":"Javelle, J., Mhalla, M., Perdrix, S.: New protocols and lower bound for quantum secret sharing with graph states. arXiv:1109.1487 (September 2011)"},{"key":"16_CR13","unstructured":"Joyner, D.: On quadratic residue codes and hyperelliptic curves. ArXiv Mathematics e-prints (September 2006)"},{"key":"16_CR14","unstructured":"Kotzig, A.: Eulerian lines in finite 4-valent graphs and their transformations. In: Colloqium on Graph Theory, pp. 219\u2013230. Academic Press (1968)"},{"key":"16_CR15","unstructured":"Lov\u00e1sz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Colloquia Mathematica Societatis Janos Bolyai, pp. 609\u2013627 (1975)"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"42309","DOI":"10.1103\/PhysRevA.78.042309","volume":"78","author":"D. Markham","year":"2008","unstructured":"Markham, D., Sanders, B.C.: Graph states for quantum secret sharing. Physical Review A\u00a078, 042309 (2008)","journal-title":"Physical Review A"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1435375.1435385","volume":"5","author":"S.-I. Oum","year":"2008","unstructured":"Oum, S.-I.: Approximating rank-width and clique-width quickly. ACM Trans. Algorithms\u00a05, 10:1\u201310:20 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"22","key":"16_CR18","doi-asserted-by":"publisher","first-page":"5188","DOI":"10.1103\/PhysRevLett.86.5188","volume":"86","author":"R. Raussendorf","year":"2001","unstructured":"Raussendorf, R., Briegel, H.: A one-way quantum computer. Physical Review Letters\u00a086(22), 5188\u20135191 (2001)","journal-title":"Physical Review Letters"},{"key":"16_CR19","unstructured":"Schmidt, W.M.: Equations over finite fields: an elementary approach, 2nd edn. Kendrick Press (2004)"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.physleta.2006.03.026","volume":"356","author":"S. Severini","year":"2006","unstructured":"Severini, S.: Two-colorable graph states with maximal schmidt measure. Physics Letters A\u00a0356, 99 (2006)","journal-title":"Physics Letters A"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Vardy, A.: Algorithmic complexity in coding theory and the minimum distance problem. In: STOC, pp. 92\u2013109 (1997)","DOI":"10.1145\/258533.258559"},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1073\/pnas.34.5.204","volume":"34","author":"A. Weil","year":"1948","unstructured":"Weil, A.: On some exponential sums. Proceedings of the National Academy of Sciences\u00a034, 204\u2013207 (1948)","journal-title":"Proceedings of the National Academy of Sciences"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34611-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:00:39Z","timestamp":1620133239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34611-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346101","9783642346118"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34611-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}