6 search results - page 2 / 2 » Deciding Clique-Width for Graphs of Bounded Tree-Width |
LPAR
2004
Springer
13 years 10 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...