"An Exact Algorithm to Check the Existence of (Elementary) Paths and a ..."

Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-35843-2_23

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sofsem/KanteLM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sofsem/KanteLM13
Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège:
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions. SOFSEM 2013: 257-267

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.