Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Fomin, F. V., Heggernes, P., & Arne Telle, J. Algorithmica, 41(2):73-87, 2004. Paper bibtex @article{ dblp3948906,
title = {Graph Searching, Elimination Trees, and a Generalization of Bandwidth},
author = {Fedor V. Fomin and Pinar Heggernes and Jan Arne Telle},
author_short = {Fomin, F. V. and Heggernes, P. and Arne Telle, J.},
bibtype = {article},
type = {article},
year = {2004},
key = {dblp3948906},
id = {dblp3948906},
biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/FominHT04},
url = {http://dx.doi.org/10.1007/s00453-004-1117-y},
journal = {Algorithmica},
pages = {73-87},
number = {2},
volume = {41},
text = {Algorithmica 41(2):73-87 (2004)}
}
Downloads: 0
{"_id":"bFQdNFTDYy3pvxCGE","bibbaseid":"fomin-heggernes-arnetelle-graphsearchingeliminationtreesandageneralizationofbandwidth-2004","downloads":0,"creationDate":"2015-06-23T17:42:40.126Z","title":"Graph Searching, Elimination Trees, and a Generalization of Bandwidth","author_short":["Fomin, F. V.","Heggernes, P.","Arne Telle, J."],"year":2004,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/algorithmica/FominHT04","bibdata":{"title":"Graph Searching, Elimination Trees, and a Generalization of Bandwidth","author":["Fedor V. Fomin","Pinar Heggernes","Jan Arne Telle"],"author_short":["Fomin, F. V.","Heggernes, P.","Arne Telle, J."],"bibtype":"article","type":"article","year":"2004","key":"dblp3948906","id":"dblp3948906","biburl":"http://www.dblp.org/rec/bibtex/journals/algorithmica/FominHT04","url":"http://dx.doi.org/10.1007/s00453-004-1117-y","journal":"Algorithmica","pages":"73-87","number":"2","volume":"41","text":"Algorithmica 41(2):73-87 (2004)","bibtex":"@article{ dblp3948906,\n title = {Graph Searching, Elimination Trees, and a Generalization of Bandwidth},\n author = {Fedor V. Fomin and Pinar Heggernes and Jan Arne Telle},\n author_short = {Fomin, F. V. and Heggernes, P. and Arne Telle, J.},\n bibtype = {article},\n type = {article},\n year = {2004},\n key = {dblp3948906},\n id = {dblp3948906},\n biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/FominHT04},\n url = {http://dx.doi.org/10.1007/s00453-004-1117-y},\n journal = {Algorithmica},\n pages = {73-87},\n number = {2},\n volume = {41},\n text = {Algorithmica 41(2):73-87 (2004)}\n}","bibbaseid":"fomin-heggernes-arnetelle-graphsearchingeliminationtreesandageneralizationofbandwidth-2004","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s00453-004-1117-y"},"downloads":0},"search_terms":["graph","searching","elimination","trees","generalization","bandwidth","fomin","heggernes","arne telle"],"keywords":[],"authorIDs":["55899a8faca630573e0006e6"],"dataSources":["urczjP4GN2QZgCoZj"]}