Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

CORR
2007
Springer

favoriteEmaildiscussreport

106views Education» more CORR 2007»

A Backtracking-Based Algorithm for Computing Hypertree-Decompositions

13 years 4 months ago

A Backtracking-Based Algorithm for Computing Hypertree-Decompositions

Download www.ics.uci.edu

Georg Gottlob, Marko Samer

Real-time Traffic

CORR 2007 | Education |

claim paper

Related Content

» Hypertree Decompositions Structure Algorithms and Applications

» A Greedy Algorithm for Constructing a LowWidth Generalized Hypertree Decomposition

» Approximating fractional hypertree width

» Generalized hypertree decompositions nphardness and tractable variants

» Examining DCSP coordination tradeoffs

» Goldreichs OneWay Function Candidate and Myopic Backtracking Algorithms

» Preferred link based delayconstrained leastcost routing in wide area networks

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Georg Gottlob, Marko Samer

Comments (0)