"Finding Edge-Disjoint Paths in Partial k-Trees."

Xiao Zhou, Syurei Tamura, Takao Nishizeki (2000)

> Home

Details and statistics

DOI: 10.1007/S004539910002

access: closed

type: Journal Article

metadata version: 2020-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ZhouTN00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ZhouTN00
Xiao Zhou, Syurei Tamura, Takao Nishizeki:
Finding Edge-Disjoint Paths in Partial k-Trees. Algorithmica 26(1): 3-30 (2000)

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.