How to use the minimal separators of a graph for its chordal triangulation (Q4645172)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6999426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to use the minimal separators of a graph for its chordal triangulation |
scientific article; zbMATH DE number 6999426 |
Statements
How to use the minimal separators of a graph for its chordal triangulation (English)
0 references
10 January 2019
0 references
maximal clique
0 references
interval graph
0 references
maximal chain
0 references
chordal graph
0 references
minimal separator
0 references
0 references
0.90343827
0 references
0.8951854
0 references
0 references
0.8939673
0 references
0.8928786
0 references
0.8890562
0 references
