Efficient reassembling of graphs, part 1: the linear case
Crossref DOI link: https://doi.org/10.1007/s10878-016-0024-x
Published Online: 2016-05-06
Published Print: 2017-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kfoury, Assaf
Mirzaei, Saber
Funding for this research was provided by:
National Science Foundation (CCF-0820138)
National Science Foundation (CNS-1135722)
Text and Data Mining valid from 2016-05-06
Version of Record valid from 2016-05-06
Article History
First Online: 6 May 2016