A Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs

Journals Menu

Follow SCIRP

	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

International Journal of Communications, Network and System Sciences

ISSN Print: 1913-3715
ISSN Online: 1913-3723
www.scirp.org/journal/ijcns
E-mail: ijcns@scirp.org

Google-based Impact Factor: 0.68
Citations h5-index & Ranking

Journals Menu

"A Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs"
written by Tianlong Gu, Liang Chang, Zhoubo Xu,
published by International Journal of Communications, Network and System Sciences, Vol.4 No.2, 2011

has been cited by the following article(s):

Google Scholar
CrossRef

[1]	A dynamic and static data based matching method for cloud 3D printing
	2020

[2]	Constrained maximum weighted bipartite matching: a novel approach to radio broadcast scheduling
	2019

[3]	A Study on Rapid Incremental Maximum Flow Algorithm in Dynamic Network
	2018

[4]	On graph algorithms for large-scale graphs
	2015

[5]	IMPACT FACTOR 2019: 0.755
	2013

[6]	IMPACT FACTOR 2018: 0.741
	2013

[7]	Maximum Semi-Matching Problem in Bipartite Graphs
	Discussiones Mathematicae Graph Theory, 2013

[8]	MAXIMUM SEMI-MATCHING AND QUASI-MATCHING 3 PROBLEMS IN BIPARTITE GRAPHS 4
	2011

[9]	A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs (Maximum semi-matching problem in bipartite graphs)
	2011

Follow SCIRP

	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

International Journal of Communications, Network and System Sciences

International Journal of Communications, Network and System Sciences

Journals Menu

Home

About SCIRP

Service

Policies