Tree Spanners for Bipartite Graphs and Probe Interval Graphs

Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara. Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica, 47(1):27-51, 2007. [doi]

@article{BrandstadtDLLU07,
  title = {Tree Spanners for Bipartite Graphs and Probe Interval Graphs},
  author = {Andreas Brandstädt and Feodor F. Dragan and Hoàng-Oanh Le and Van Bang Le and Ryuhei Uehara},
  year = {2007},
  doi = {10.1007/s00453-006-1209-y},
  url = {http://dx.doi.org/10.1007/s00453-006-1209-y},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BrandstadtDLLU07},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {47},
  number = {1},
  pages = {27-51},
}