A new algorithm for finding minimal cycle-breaking sets of turns in a graph.
Levitin, Lev; Karpovsky, Mark; Mustafa, Mehmet; Zakrevski, Lev
Journal of Graph Algorithms and Applications (2006)
- Volume: 10, Issue: 2, page 387-420
- ISSN: 1526-1719
Access Full Article
top
How to cite
topLevitin, Lev, et al. "A new algorithm for finding minimal cycle-breaking sets of turns in a graph.." Journal of Graph Algorithms and Applications 10.2 (2006): 387-420. <http://eudml.org/doc/55418>.
@article{Levitin2006,
author = {Levitin, Lev, Karpovsky, Mark, Mustafa, Mehmet, Zakrevski, Lev},
journal = {Journal of Graph Algorithms and Applications},
keywords = {undirected graph; deadlock-free wormhole routing},
language = {eng},
number = {2},
pages = {387-420},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {A new algorithm for finding minimal cycle-breaking sets of turns in a graph.},
url = {http://eudml.org/doc/55418},
volume = {10},
year = {2006},
}
TY - JOUR
AU - Levitin, Lev
AU - Karpovsky, Mark
AU - Mustafa, Mehmet
AU - Zakrevski, Lev
TI - A new algorithm for finding minimal cycle-breaking sets of turns in a graph.
JO - Journal of Graph Algorithms and Applications
PY - 2006
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 10
IS - 2
SP - 387
EP - 420
LA - eng
KW - undirected graph; deadlock-free wormhole routing
UR - http://eudml.org/doc/55418
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.