A greedy algorithm to construct sparse graph by using ranked dictionary
Crossref DOI link: https://doi.org/10.1007/s41060-016-0020-3
Published Online: 2016-08-19
Published Print: 2016-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Han, Shuchu
Qin, Hong
License valid from 2016-08-19