scientific article; zbMATH DE number 1304320
From MaRDI portal
Publication:4251051
zbMath0924.05062MaRDI QIDQ4251051
Vincent Bouchitte, Ioan Todinca
Publication date: 10 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
triangulationtreewidthpolynomial time algorithmsminimum fill-inweakly triangulated graphspotential maximal clique
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
On 3-degree 4-chordal graphs ⋮ A revisit of the scheme for computing treewidth and minimum fill-in ⋮ Listing all potential maximal cliques of a graph
This page was built for publication:
