BibTeX record conf/wg/Dragan01

download as .bib file

@inproceedings{DBLP:conf/wg/Dragan01,
  author       = {Feodor F. Dragan},
  editor       = {Andreas Brandst{\"{a}}dt and
                  Van Bang Le},
  title        = {Estimating All Pairs Shortest Paths in Restricted Graph Families:
                  {A} Unified Approach},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
                  {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2204},
  pages        = {103--116},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45477-2\_11},
  doi          = {10.1007/3-540-45477-2\_11},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/Dragan01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.