"A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph."

Lev B. Levitin et al. (2006)

> Home

Details and statistics

DOI: 10.7155/JGAA.00134

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jgaa/LevitinKMZ06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgaa/LevitinKMZ06
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa, Lev Zakrevski:
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph. J. Graph Algorithms Appl. 10(2): 387-420 (2006)

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.