Anne Berry, Jean-Paul Bordat, Olivier Cogis  Home/Search
Context Related
| isima.fr/~berry/generating.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: isima.fr/~berry/publis (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an ecient algorithm which computes the set of minimal separators of a graph in O(n 3 ) time per separator, thus gaining a factor of n 2 on the current best-time algorithms for this problem. Our process is based on a new structural result, derived from the work of Kloks and Kratsch on listing all the minimal separators of a graph. (Update)
Cited by: More
Automating Resource Management for Distributed Business Processes - Ginis (2002) (Correct)
Maintaining Class Membership Information - Berry, Sigayret (2002) (Correct)
Concept Lattices and Undirected Graphs - Berry (2004) (Correct)
Similar documents (at the sentence level):
36.0%: Generating All the Minimal Separators of a Graph - Berry, Bordat, Cogis (1999) (Correct)
Active bibliography (related documents): More All
0.9: Weaving through a Crowd of Minimal Separators - Berry (2003) (Correct)
0.7: Treewidth and Minimum Fill-in of Weakly Triangulated Graphs - Bouchitte, Todinca (1998) (Correct)
0.6: Recognizing Weakly Triangulated Graphs by Edge Separability - Berry, Bordat, Heggernes (2000) (Correct)
Similar documents based on text: More All
0.8: Decomposition By Clique Minimal Separators - Berry, Bordat (1999) (Correct)
0.6: Triangulated and Weakly Triangulated Graphs: Simpliciality in.. - Berry, Bordat (2000) (Correct)
0.5: Local LexBFS Properties in an Arbitrary Graph (Extended Abstract) - Berry, Bordat (2000) (Correct)
Related documents from co-citation: More All
10: Algorithmic aspects of vertex elimination on graphs (context) - Rose, Tarjan et al. - 1976
8: Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
8: On rigid circuit graphs (context) - Dirac - 1961
BibTeX entry: (Update)
A. Berry, J.P. Bordat, and O. Cogis. Generating all the minimal separators of a graph. In Workshop on Graphs WG'99, Lecture Notes in Computer Science. Springer-Verlag, 1999. http://citeseer.ist.psu.edu/article/berry99generating.html More
@article{ berry00generating,
author = "Anne Berry and Jean Paul Bordat and Olivier Cogis",
title = "Generating All the Minimal Separators of a Graph",
journal = "International Journal of Foundations of Computer Science",
volume = "11",
number = "3",
pages = "397-403",
year = "2000",
url = "citeseer.ist.psu.edu/article/berry99generating.html" }
Citations (may not include all citations):40 Treewidth and pathwidth of permutation graphs - Bodlaender, Kloks et al. - 1995
21 How to use the minimal separators of a graph for its chordal.. - Parra, Sche - 1995
17 A Fast Algorithm for building Lattices (context) - Nourine, Raynaud - 1999
17 Separability Generalizes Dirac's Theorem - Berry, Bordat - 1998
12 Structural and algorithmic aspects of chordal graph embeddin.. - Parra - 1996
12 Listing all minimal separators of a graph - Kloks, Kratsch - 1998
11 A Wide-Range Ecient Algorithm for Minimal Triangulation (context) - Berry - 1999
10 Aspects algorithmiques des triangulations minimales des grap.. (context) - Todinca - 1999
8 Erratum to the ESA'93 Proceedings (context) - Bodlaender, Kloks et al. - 1994
8 On treewidth and minimum ll-in of asteroidal triple-free gra.. (context) - Kloks, Kratsch et al. - 1997
8 esarticulation d'un graphe (context) - Berry - 1998
8 Finding all minimal separators of a graph (context) - Kloks, Kratsch - 1994
5 Listing all potential maximal cliques of a graph - Bouchitt, Todinca - 2000
4 Ecient enumeration of all minimal separators in a graph (context) - Sheng, Liang - 1997
3 Treewidth and minimum ll-in of weakly triangulated graphs (context) - Bouchitt, Todinca - 1999
2 Abhandlungen aus dem Mathematischen Seminar des Universitat.. (context) - Escalante, ande - 1972
2 Computing treewidth and minimum ll-in: all you need are the .. (context) - Bodlaender, Kloks et al. - 1993
1 dans un graphe nonorient e (context) - Berry, Bordat et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.isima.fr/~berry/publis.html): More
Triangulated and Weakly Triangulated Graphs: Simpliciality in.. - Berry, Bordat (2001) (Correct)
Local LexBFS Properties in an Arbitrary Graph - Berry, Bordat (2000) (Correct)
Asteroidal Triples of Moplexes - Berry, Bordat (2000) (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