The algorithmic use of hypertree structure and maximum neighborhood orderings

Andreas Brandstädt, V. C., & Dragan, F. (1998). The algorithmic use of hypertree structure and maximum neighborhood orderings.

Type

Unclassified

Intellectual base

Unclassified

Year

1998

DOI

10.1016/s0166-218x(97)00125-x

Link

https://doi.org/10.1016/s0166-218x(97)00125-x

Cited by

1 citation across 1 artifact.

Domain-specific

• Dually chordal graph
  • Dually chordal graphs form a structural graph class characterized by compatible maximum neighborhoods and hypertree organization of maximal cliques.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:62ba6fe14761 · see in the full table