The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The algorithmic use of hypertree structure and maximum neighbourhood orderings |
scientific article |
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
