Sciweavers

TCS
2008
13 years 11 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer