Efficient algorithms for minimal disjoint path problems on chordal graphs

C. P. Gopalakrishnan, C. Pandu Rangan, Satyan R. Coorg. Efficient algorithms for minimal disjoint path problems on chordal graphs. Discussiones Mathematicae Graph Theory, 15(2):119-145, 1995. [doi]

@article{GopalakrishnanRC95,
  title = {Efficient algorithms for minimal disjoint path problems on chordal graphs},
  author = {C. P. Gopalakrishnan and C. Pandu Rangan and Satyan R. Coorg},
  year = {1995},
  doi = {10.7151/dmgt.1012},
  url = {http://dx.doi.org/10.7151/dmgt.1012},
  researchr = {https://researchr.org/publication/GopalakrishnanRC95},
  cites = {0},
  citedby = {0},
  journal = {Discussiones Mathematicae Graph Theory},
  volume = {15},
  number = {2},
  pages = {119-145},
}