A sufficiently fast algorithm for finding close to optimal clique trees
- 12 January 2001
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 125 (1-2), 3-17
- https://doi.org/10.1016/s0004-3702(00)00075-8
Abstract
No abstract availableAll Related Versions
This publication has 14 references indexed in Scilit:
- Efficient Parallel Algorithms for Graphs of Bounded Tree-WidthJournal of Algorithms, 1996
- Multiway cuts in directed and node weighted graphsLecture Notes in Computer Science, 1994
- A linear time algorithm for finding tree-decompositions of small treewidthPublished by Association for Computing Machinery (ACM) ,1993
- The complexity of multiway cuts (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- The optimal multiterminal cut problemPublished by American Mathematical Society (AMS) ,1991
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Tree clustering for constraint networksArtificial Intelligence, 1989
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985