6 search results - page 1 / 2 » Width Parameters Beyond Tree-width and their Applications |
MFCS
2005
Springer
13 years 11 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 11 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...
CJ
2008
13 years 5 months ago
2008
UAI
1996
13 years 7 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
CSB
2005
IEEE
13 years 11 months ago
2005
IEEE
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...