An $$O(|E(G)|^2)$$ O ( | E ( G ) | 2 ) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

An $$O(|E(G)|^2)$$ O ( | E ( G ) | 2 ) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs

Published:2017-11-28 Issue:3 Volume:35 Page:740-753
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Feng Xing,Zhang Lianzhu,Zhang Mingzu

Funder

National Natural Science Foundation of China

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/article/10.1007/s10878-017-0207-0/fulltext.html

Reference18 articles.

1. Alom BMM, Das S, Islam MS (2010) Finding the maximum matching in a bipartite graph. DUET J 1(1):33–36

2. Amjadi J, Nazari-Moghaddam S, Sheikholeshami SM (2017) Global total Roman domination in graphs. Discrete Math Algorithms Appl 9(4):1750050

3. de Carvalho MH, Lucchesi CL, Murty USR (2005) On the number of dissimilar Pfaffian orientations of graphs. RAIRO Inf Theor Appl 39:93–113

4. Kasteleyn PW (1961) The statistics of dimers on a lattice. I. The number of dimer arrangments on a quadratic lattice. Physica 27:1209–1225

5. Kasteleyn PW (1967) Graph theory and crystal physics. In: Harary F (ed) Graph theory and physics theoretical. Academic Press, London, pp 43–110

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP