Minimal elimination ordering inside a given chordal graph (Q4373676)
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 1107728
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal elimination ordering inside a given chordal graph |
scientific article; zbMATH DE number 1107728 |
Statements
8 April 1998
0 references
chordal graph
0 references
minimal fill-in
0 references
0.92804825
0 references
0.91611624
0 references
0.9065306
0 references
0.90127814
0 references
0.89731544
0 references
0.8936476
0 references
0.8871898
0 references
Minimal elimination ordering inside a given chordal graph (English)
0 references
Let be given a graph \(G=(V,E)\) and a chordal supergraph \((V,E_2)\). In time \(O(|V||E|)\) one can compute a chordal graph \((V,E_1)\) with \(E \subseteq E_1 \subseteq E_2\) such that for all \(E'\) with \(E \subseteq E' \subset E_1\) the graph \((V,E')\) is not chordal. For the entire collection see [Zbl 0877.00011].
0 references
