"Efficient algorithms for minimal disjoint path problems on chordal graphs."

C. P. Gopalakrishnan, C. Pandu Rangan, Satyan R. Coorg (1995)

> Home

Details and statistics

DOI: 10.7151/DMGT.1012

access: open

type: Journal Article

metadata version: 2020-06-08

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dmgt/GopalakrishnanRC95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmgt/GopalakrishnanRC95
C. P. Gopalakrishnan, C. Pandu Rangan, Satyan R. Coorg:
Efficient algorithms for minimal disjoint path problems on chordal graphs. Discuss. Math. Graph Theory 15(2): 119-145 (1995)

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.