Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Fomin, F. V., Heggernes, P., & Arne Telle, J. Algorithmica, 41(2):73-87, 2004.
Graph Searching, Elimination Trees, and a Generalization of Bandwidth [link]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