The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368)
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 1139432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The algorithmic use of hypertree structure and maximum neighbourhood orderings |
scientific article; zbMATH DE number 1139432 |
Statements
The algorithmic use of hypertree structure and maximum neighbourhood orderings (English)
0 references
2 August 1998
0 references
Graphs with a tree structure which are dual (in the sense of hypergraphs) to the ones of chordal graphs are studied. These graphs are called dually chordal. The corresponding vertex elimination orderings of dually chordal graphs are the maximum neighbourhood orderings. In this paper, a systematic treatment of the algorithmic applications of maximum neighbourhood orderings is undertaken. These orderings are useful, especially for dominating-like and distance problems.
0 references
graphic algorithms
0 references
Steiner tree
0 references
tree structure
0 references
chordal graphs
0 references
dually chordal graphs
0 references
maximum neighbourhood orderings
0 references
0 references
0 references
0.7751781940460205
0 references
0.7530636787414551
0 references
0.7372598052024841
0 references
0.7266491055488586
0 references
