Sciweavers

12 search results - page 3 / 3
» Bounded Tree-Width and CSP-Related Problems
Sort
View
TALG
2010
110views more  TALG 2010»
13 years 3 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
ICFP
2003
ACM
14 years 5 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano