"Finding paths in graphs avoiding forbidden transitions."

Stefan Szeider (2003)

> Home

Details and statistics

DOI: 10.1016/S0166-218X(02)00251-2

access: open

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/Szeider03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Szeider03
Stefan Szeider:
Finding paths in graphs avoiding forbidden transitions. Discret. Appl. Math. 126(2-3): 261-273 (2003)

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.