A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (Q1944936)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph |
scientific article; zbMATH DE number 6149216
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph |
scientific article; zbMATH DE number 6149216 |
Statements
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (English)
0 references
28 March 2013
0 references
graph algorithms
0 references
LexBFS
0 references
MCS
0 references
minimal separator
0 references
maximal clique
0 references
moplex ordering
0 references
0.9222976
0 references
0.91459185
0 references
0.9048506
0 references
0.90111893
0 references
0.8946911
0 references
0.8939496
0 references
0.8928786
0 references
