scientific article; zbMATH DE number 1414319
From MaRDI portal
Publication:4942656
zbMath0941.05514MaRDI QIDQ4942656
Publication date: 16 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Listing all the minimal separators of a 3-connected planar graph ⋮ Characterizations and algorithmic applications of chordal graph embeddings ⋮ Efficient enumeration of all minimal separators in a graph ⋮ On treewidth and minimum fill-in of asteroidal triple-free graphs ⋮ How to use the minimal separators of a graph for its chordal triangulation ⋮ Solution methods for the vertex variant of the network system vulnerability analysis problem
This page was built for publication:
