1653 search results - page 1 / 331 » Directed tree-width examples |
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...
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...
CGA
2011
12 years 8 months ago
2011
We present a data-driven algorithm for interactive 3D human character posing. We formulate the problem in a maximum a posteriori (MAP) framework by combining the user’s inputs w...
EIS
2011
12 years 11 months ago
2011
Most software engineering techniques that deal with software products customization are based on anticipation: The software designer has to foresee, somehow, the future needs for ...
JCT
2007
13 years 4 months ago
2007
In [1] Johnson, Robertson, Seymour and Thomas define the notion of directed tree-width dtw(D) of a directed graph D. They ask whether dtw(D) ≥ k − 1 implies that D has a have...