"Linear-time computability of combinatorial problems on series-parallel graphs."

K. Takamizawa, Takao Nishizeki, Nobuji Saito (1982)

> Home

Details and statistics

DOI: 10.1145/322326.322328

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/TakamizawaNS82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/TakamizawaNS82
K. Takamizawa, Takao Nishizeki, Nobuji Saito:
Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29(3): 623-641 (1982)

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.