Login / Signup
On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks.
Martin Makuch
Peter Ruzicka
Published in:
SIROCCO (2001)
Keyphrases
</>
atm networks
admission control
traffic engineering
decision problems
end to end
shortest path
databases
social networks
expert systems
social network analysis
network structure
finite number
graph theoretic
bounded treewidth
bounded degree