"On Minimum Connecting Transition Sets in Graphs."

Thomas Bellitto, Benjamin Bergougnoux (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-030-00256-5_4

access: closed

type: Conference or Workshop Paper

metadata version: 2018-09-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/BellittoB18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/BellittoB18
Thomas Bellitto, Benjamin Bergougnoux:
On Minimum Connecting Transition Sets in Graphs. WG 2018: 40-51

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.