{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:41Z","timestamp":1740122441867,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T00:00:00Z","timestamp":1511827200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11171279","11471273"],"award-info":[{"award-number":["11171279","11471273"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10878-017-0207-0","type":"journal-article","created":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T05:43:51Z","timestamp":1511847831000},"page":"740-753","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An $$O(|E(G)|^2)$$ O ( | E ( G ) | 2 ) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Xing","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lianzhu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingzu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,28]]},"reference":[{"issue":"1","key":"207_CR1","first-page":"33","volume":"1","author":"BMM Alom","year":"2010","unstructured":"Alom BMM, Das S, Islam MS (2010) Finding the maximum matching in a bipartite graph. DUET J 1(1):33\u201336","journal-title":"DUET J"},{"issue":"4","key":"207_CR2","doi-asserted-by":"crossref","first-page":"1750050","DOI":"10.1142\/S1793830917500501","volume":"9","author":"J Amjadi","year":"2017","unstructured":"Amjadi J, Nazari-Moghaddam S, Sheikholeshami SM (2017) Global total Roman domination in graphs. Discrete Math Algorithms Appl 9(4):1750050","journal-title":"Discrete Math Algorithms Appl"},{"key":"207_CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1051\/ita:2005005","volume":"39","author":"MH Carvalho de","year":"2005","unstructured":"de Carvalho MH, Lucchesi CL, Murty USR (2005) On the number of dissimilar Pfaffian orientations of graphs. RAIRO Inf Theor Appl 39:93\u2013113","journal-title":"RAIRO Inf Theor Appl"},{"key":"207_CR4","doi-asserted-by":"crossref","first-page":"1209","DOI":"10.1016\/0031-8914(61)90063-5","volume":"27","author":"PW Kasteleyn","year":"1961","unstructured":"Kasteleyn PW (1961) The statistics of dimers on a lattice. I. The number of dimer arrangments on a quadratic lattice. Physica 27:1209\u20131225","journal-title":"Physica"},{"key":"207_CR5","first-page":"43","volume-title":"Graph theory and physics theoretical","author":"PW Kasteleyn","year":"1967","unstructured":"Kasteleyn PW (1967) Graph theory and crystal physics. In: Harary F (ed) Graph theory and physics theoretical. Academic Press, London, pp 43\u2013110"},{"issue":"4","key":"207_CR6","doi-asserted-by":"crossref","first-page":"1750045","DOI":"10.1142\/S1793830917500458","volume":"9","author":"B Krishnakumari","year":"2017","unstructured":"Krishnakumari B, Chellali M, Venkatakrishnan YB (2017) Double vertex-edge domination. Discrete Math Algorithms Appl 9(4):1750045","journal-title":"Discrete Math Algorithms Appl"},{"key":"207_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.tcs.2014.01.030","volume":"527","author":"F Lin","year":"2014","unstructured":"Lin F, Zhang L, Lu F (2014) Pfaffian orientations for a type of bipartite graph. Theoret Comput Sci 527:97\u2013101","journal-title":"Theoret Comput Sci"},{"key":"207_CR8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(75)90048-9","volume":"18","author":"CHC Little","year":"1975","unstructured":"Little CHC (1975) A characterization of convertible (0,1)-matrices. J Comb Theory Ser B 18:187\u2013208","journal-title":"J Comb Theory Ser B"},{"key":"207_CR9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(87)90021-9","volume":"43","author":"L Lov\u00e1sz","year":"1987","unstructured":"Lov\u00e1sz L (1987) Matching structure and the matching lattice. J Comb Theory Ser B 43:187\u2013222","journal-title":"J Comb Theory Ser B"},{"key":"207_CR10","volume-title":"Matching theory","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L, Plummer MD (1986) Matching theory. North-Holland, Amsterdam"},{"key":"207_CR11","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/s10878-012-9533-4","volume":"27","author":"FL Lu","year":"2014","unstructured":"Lu FL, Zhang LZ (2014) The Pfaffian property of Cartesian products of graphs. J Comb Optim 27:530\u2013540","journal-title":"J Comb Optim"},{"key":"207_CR12","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.dam.2014.09.002","volume":"181","author":"FL Lu","year":"2015","unstructured":"Lu FL, Zhang LZ, Wang Y (2015) The Pfaffian property of circulant graphs. Discrete Appl Math 181:185\u2013192","journal-title":"Discrete Appl Math"},{"key":"207_CR13","doi-asserted-by":"crossref","unstructured":"McCuaig W (2004) P\u00f3lya\u2019s permanent problem. Electron J Comb 11:R79","DOI":"10.37236\/1832"},{"key":"207_CR14","unstructured":"Norine S (2005) Matching structure and Pfaffian orientations of graphs, Doctoral dissertation. Georgia Institute of Technology"},{"issue":"2","key":"207_CR15","doi-asserted-by":"crossref","first-page":"929","DOI":"10.2307\/121059","volume":"150","author":"N Robertson","year":"1999","unstructured":"Robertson N, Seymour PD, Thomas R (1999) Permanents, Pfaffian orientations and even directed circuits. Ann Math 150(2):929\u2013975","journal-title":"Ann Math"},{"key":"207_CR16","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant LG (1979) The complexity of computing the permanent. Theoret Comput Sci 8:189\u2013201","journal-title":"Theoret Comput Sci"},{"key":"207_CR17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0166-218X(89)90053-X","volume":"25","author":"VV Vazirani","year":"1989","unstructured":"Vazirani VV, Yannakakis M (1989) Pfaffian orientations, 0\u20131 permanents, and even cycles in directed graphs. Discrete Appl Math 25:179\u2013190","journal-title":"Discrete Appl Math"},{"key":"207_CR18","doi-asserted-by":"crossref","first-page":"1957","DOI":"10.1007\/s11425-012-4561-1","volume":"56","author":"LZ Zhang","year":"2012","unstructured":"Zhang LZ, Wang Y, Lu FL (2012) Pfaffian graphs embedding on the torus. Sci China Math 56:1957\u20131964","journal-title":"Sci China Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0207-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0207-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0207-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,22]],"date-time":"2020-10-22T23:49:44Z","timestamp":1603410584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0207-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,28]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["207"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0207-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,11,28]]}}}