Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing.
Rastislav KralovicPeter RuzickaPublished in: SIROCCO (1999)
Keyphrases
- deadlock free
- routing algorithm
- markov equivalence classes
- connected graphs
- bounded treewidth
- packet transmission
- routing protocol
- packet switching
- network layer
- switched networks
- ad hoc networks
- ip traffic
- shortest path
- web services
- transaction processing
- real time
- databases
- data mining
- concurrency control
- end to end
- np complete
- access control