Sparsest cuts and concurrent flows in product graphs. Bonsma, P. S. Discrete Applied Mathematics (DAM), 136(2-3):173-182, 2004. Paper bibtex @article{ dblp3632852,
title = {Sparsest cuts and concurrent flows in product graphs},
author = {Paul S. Bonsma},
author_short = {Bonsma, P. S.},
bibtype = {article},
type = {article},
year = {2004},
key = {dblp3632852},
id = {dblp3632852},
biburl = {http://www.dblp.org/rec/bibtex/journals/dam/Bonsma04},
url = {http://dx.doi.org/10.1016/S0166-218X(03)00439-6},
journal = {Discrete Applied Mathematics (DAM)},
pages = {173-182},
number = {2-3},
volume = {136},
text = {Discrete Applied Mathematics (DAM) 136(2-3):173-182 (2004)}
}
Downloads: 0
{"_id":{"_str":"52430439b1392ed1430016bf"},"__v":53,"authorIDs":["545735e62abc8e9f370001a2"],"author_short":["Bonsma, P. S."],"bibbaseid":"bonsma-sparsestcutsandconcurrentflowsinproductgraphs-2004","bibdata":{"title":"Sparsest cuts and concurrent flows in product graphs","author":["Paul S. Bonsma"],"author_short":["Bonsma, P. S."],"bibtype":"article","type":"article","year":"2004","key":"dblp3632852","id":"dblp3632852","biburl":"http://www.dblp.org/rec/bibtex/journals/dam/Bonsma04","url":"http://dx.doi.org/10.1016/S0166-218X(03)00439-6","journal":"Discrete Applied Mathematics (DAM)","pages":"173-182","number":"2-3","volume":"136","text":"Discrete Applied Mathematics (DAM) 136(2-3):173-182 (2004)","bibtex":"@article{ dblp3632852,\n title = {Sparsest cuts and concurrent flows in product graphs},\n author = {Paul S. Bonsma},\n author_short = {Bonsma, P. S.},\n bibtype = {article},\n type = {article},\n year = {2004},\n key = {dblp3632852},\n id = {dblp3632852},\n biburl = {http://www.dblp.org/rec/bibtex/journals/dam/Bonsma04},\n url = {http://dx.doi.org/10.1016/S0166-218X(03)00439-6},\n journal = {Discrete Applied Mathematics (DAM)},\n pages = {173-182},\n number = {2-3},\n volume = {136},\n text = {Discrete Applied Mathematics (DAM) 136(2-3):173-182 (2004)}\n}","bibbaseid":"bonsma-sparsestcutsandconcurrentflowsinproductgraphs-2004","role":"author","urls":{"Paper":"http://dx.doi.org/10.1016/S0166-218X(03)00439-6"},"downloads":0,"html":""},"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/dam/Bonsma04","downloads":0,"keywords":[],"search_terms":["sparsest","cuts","concurrent","flows","product","graphs","bonsma"],"title":"Sparsest cuts and concurrent flows in product graphs","year":2004,"dataSources":["6W3vAiEPnoKg8kW5S"]}