minimal cycle-breaking sets

JGAA
2006

127views more JGAA 2006»

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

14 years 12 days ago

We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...

Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...

claim paper

Read More »

click to vote

IPPS
2009
IEEE

106views Distributed And Parallel Com...» more IPPS 2009»

Deadlock prevention by turn prohibition in interconnection networks

14 years 7 months ago

Download mark.bu.edu

Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...

Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers