BibTeX record journals/ton/XuCXQH06

download as .bib file

@article{DBLP:journals/ton/XuCXQH06,
  author       = {Dahai Xu and
                  Yang Chen and
                  Yizhi Xiong and
                  Chunming Qiao and
                  Xin He},
  title        = {On the complexity of and algorithms for finding the shortest path
                  with a disjoint counterpart},
  journal      = {{IEEE/ACM} Trans. Netw.},
  volume       = {14},
  number       = {1},
  pages        = {147--158},
  year         = {2006},
  url          = {http://doi.acm.org/10.1145/1133553.1133565},
  doi          = {10.1145/1133553.1133565},
  timestamp    = {Tue, 22 Aug 2006 09:06:47 +0200},
  biburl       = {https://dblp.org/rec/journals/ton/XuCXQH06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics