A Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs

International Journal of Communications, Network and System Sciences

ISSN Print: 1913-3715
ISSN Online: 1913-3723
www.scirp.net/journal/ijcns
E-mail: [email protected]

Citations

"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]	Exploring science-technology linkages: A deep learning-empowered solution
	Information Processing …, 2023

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

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

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

[5]	动态网络中最大流快速增量求解
	东南大学学报 (自然科学版), 2017

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

[7]	IMPACT FACTOR 2019: 0.755
	2013

[8]	IMPACT FACTOR 2018: 0.741
	2013

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

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

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

	[email protected]
	+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

Guidelines & Policies

Home

About SCIRP

Service

Policies