Ileana Streinu, Louis Theran. Sparsity-certifying Graph Decompositions. Graphs and Combinatorics, 25(2):219-238, 2009. [doi]
@article{StreinuT09-0,
title = {Sparsity-certifying Graph Decompositions},
author = {Ileana Streinu and Louis Theran},
year = {2009},
doi = {10.1007/s00373-008-0834-4},
url = {http://dx.doi.org/10.1007/s00373-008-0834-4},
researchr = {https://researchr.org/publication/StreinuT09-0},
cites = {0},
citedby = {0},
journal = {Graphs and Combinatorics},
volume = {25},
number = {2},
pages = {219-238},
}