A vertex incremental approach for maintaining chordality
Authors:
- Anne BerryABAnne Berry
- Pinar HeggernesPHPinar Heggernes
- Yngve VillangerYVYngve Villanger
- 1 February 2006
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 306 (3) , 318-336
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A wide-range algorithm for minimal triangulation from an arbitrary orderingJournal of Algorithms, 2006
- Maximum Cardinality Search for Computing Minimal Triangulations of GraphsAlgorithmica, 2004
- A practical algorithm for making filled graphs minimalTheoretical Computer Science, 2001
- The Pathwidth and Treewidth of CographsSIAM Journal on Discrete Mathematics, 1993
- An efficient algorithm for finding a two-pair, and its applicationsDiscrete Applied Mathematics, 1991
- Maximal chordal subgraphsDiscrete Applied Mathematics, 1988
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloringDiscrete Applied Mathematics, 1986
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961