Hypertree width and related hypergraph invariants

European Journal of Combinatorics

Volumn 28, Issue 8, 2007, Pages 2167-2181

  Adler, Isolde ^a   Gottlob, Georg ^b   Grohe, Martin ^c  

^a UNIVERSITY OF FREIBURG   (Germany)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35148830525     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2007.04.013     Document Type: Article

References (14)

1. Adler I. Marshals, monotone marshals, and hypertree-width. Journal of Graph Theory 47 (2004) 275-296
2. I. Adler, A note on monotonicity cost on hypergraphs, 2005. Unpublished note
3. Cohen D.A., Jeavons P., and Gyssens M. A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. In: Kaelbling L.P., and Saffiotti A. (Eds). IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. July 30-August 5, 2005, Edinburgh, Scotland, UK (2005), Professional Book Center 72-77
4. Gottlob G., Grohe M., Musliu N., Samer M., and Scarcello F. Hypertree decompositions: Structure, algorithms, and applications. In: Kratsch D. (Ed). Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science vol. 3787 (2005), Springer Verlag 1-15
5. Gottlob G., Leone N., and Scarcello F. A comparison of structural CSP decomposition methods. Artificial Intelligence 124 2 (2000) 243-282
6. Gottlob G., Leone N., and Scarcello F. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences 64 (2002) 579-627
7. Gottlob G., Leone N., and Scarcello F. Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. Journal of Computer and System Sciences 66 (2003) 775-808
8. Grohe M., and Marx D. Constraint solving via fractional edge covers. Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 2006, 22-26 January 2006, Miami, Florida, USA (2006), ACM Press 289-298
9. Iwata S., Fleischer L., and Fujishige S. A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM 48 4 (2001) 761-777
10. Oum S.-I. Approximating rank-width and clique-width quickly. In: Kratsch D. (Ed). WG2005. Lecture Notes in Computer Science vol. 3787 (2005), Springer 49-58
11. Oum S.-I., and Seymour P.D. Approximating clique-width and branch-width. Journal of Combinatorial Theory. Series B 96 4 (2006) 514-528
12. B. Reed, Tree width and tangles: A new connectivity measure and some applications. in: R.A. Bailey (Ed.) Surveys in Combinatorics, in: LMS Lecture Note Series, vol. 241, Cambridge University Press, 1997, pp. 87-162
13. Robertson N., and Seymour P.D. Graph minors X. Obstructions to tree-decomposition. Journal of Combinatorial Theory. Series B 52 (1991) 153-190
14. Seymour P.D., and Thomas R. Graph searching and a min-max theorem for tree-width. Journal of Combinatorial Theory. Series B 58 (1993) 22-33