Kirill Shoikhet, Dan Geiger  Home/Search
Context
Related
| cs.technion.ac.il/~dang/pa...SG97.ps.gz harvard.edu/course...lation.extended.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.technion.ac.il/~dang/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An algorithm called QuickTree is developed for finding a triangulation T of a given undirected graph G such that the size of T 's maximal clique is minimum and such that no other triangulation of G is a subgraph of T . We have tested QuickTree on random graphs of up to 100 nodes for which the maximum clique in an optimal triangulation is of size 11. This is the first algorithm that can optimally triangulate graphs of such size in a reasonable time frame. This algorithm is useful for constraint... (Update)
Active bibliography (related documents): More All
0.7: A Sufficiently Fast Algorithm for Finding Close to Optimal.. - Becker, Geiger (1996) (Correct)
0.5: High Level Synthesis for Partial Scan - Flottes, Pires, Rouzeyre, Volpe (1997) (Correct)
0.4: Minimal Triangulations for Graphs with "Few" Minimal Separators - Bouchitte, Todinca (1998) (Correct)
Similar documents based on text: More All
0.2: Efficient Approximation for Triangulation of Minimum Treewidth - Amir (2001) (Correct)
0.2: Structured Variational Inference Procedures and their.. - Dan Geiger Computer (Correct)
0.1: Automated Analytic Asymptotic Evaluation of the Marginal - Likelihood For Latent (Correct)
BibTeX entry: (Update)
@misc{ shoikhet-finding,
author = "Kirill Shoikhet and Dan Geiger",
title = "Finding Optimal Triangulations Via Minimal Vertex Separators",
url = "citeseer.ist.psu.edu/shoikhet97finding.html" }
Citations (may not include all citations):3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1990
1543 Probabilistic reasoning in intelligent systems: Networks of .. (context) - Pearl - 1988
582 Local computations with probabilities on graphical structure.. (context) - Lauritzen, Spiegelhalter - 1988
284 The computational complexity of probabilistic inference usin.. (context) - Cooper - 1990
209 Computer Science Press (context) - Even - 1979
202 A linear time algorithm for finding tree-decompositions of s.. - Bodlaender
172 Complexity of finding embeddings in a k-tree (context) - Arnborg, Corneil et al. - 1987
145 Easy problems for tree-decomposable graphs - Arnborg, Lagergren et al. - 1991
141 Tree clustering for constraint networks (context) - Dechter, Pearl - 1989
135 Bayesian updating in causal probabilistic networks by local .. (context) - Jensen, Lauritzen et al. - 1990
109 Efficient algorithms for combinatorial problems on graphs wi.. (context) - Arnborg - 1985
80 The disjoint paths problem (context) - Robertson, Seymour - 1995
73 Triangulated graphs and the elimination process (context) - Rose - 1974
53 propagation and structuring in belief networks (context) - Pearl - 1986
41 Finding approximate separators and computing treewidth quick.. (context) - Reed - 1992
33 Characterization and recognition of partial 3-trees (context) - Arnborg, Proskurowski - 1986
31 Triangulation of graph-algorithms giving small total state s.. (context) - Kjaerulff - 1990
27 A sufficiently fast algorithm for finding close to optimal j.. - Becker, Geiger
23 An Introduction to chordal graphs and clique trees (context) - Peyton - 1993
21 How to use the minimal separators of a graph for its chordal.. - Parra, Scheffler - 1995
12 Computing treewidth and minimum fill-in: All you need are th.. (context) - Kloks, Bodlaender et al. - 1993
10 Efficient parallel algorithms for graphs of bounded treewidt.. (context) - Lagergren - 1996
8 Finding all minimal separators of a graph (context) - Kloks, Kratsch - 1994
8 Erratum to the ESA'93 Proceedings (context) - Kloks, Bodlaender et al. - 1994
6 Graph-theoretic concepts in computer science (context) - Bodlaender, Gilbert et al. - 1991
3 Lecture notes in Computer Science (context) - Kloks - 1995
2 Algorithmic graph theory and perfect graphs (context) - Golombic - 1980
Documents on the same site (http://www.cs.technion.ac.il/~dang/): More
A Sufficiently Fast Algorithm for Finding Close to Optimal.. - Becker, Geiger (1996) (Correct)
Approximation Algorithms for the Loop Cutset Problem - Becker, Geiger (1994) (Correct)
A Characterization of the Dirichlet Distribution with.. - Geiger, Heckerman (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC