2 search results - page 1 / 1 » Digraph measures: Kelly decompositions, games, and orderings |
TCS
2008
13 years 4 months ago
2008
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 ...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...