"Tree Spanners for Bipartite Graphs and Probe Interval Graphs."

Andreas Brandstädt et al. (2007)

> Home

Details and statistics

DOI: 10.1007/S00453-006-1209-Y

access: closed

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BrandstadtDLLU07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BrandstadtDLLU07
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.