scientific article; zbMATH DE number 1107728
From MaRDI portal
Publication:4373676
zbMath0886.05103MaRDI QIDQ4373676
Publication date: 8 April 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Minimal triangulations of graphs: a survey ⋮ A vertex incremental approach for maintaining chordality ⋮ Lex M versus MCS-M ⋮ Minimal elimination of planar graphs ⋮ Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree ⋮ Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs ⋮ Efficiently enumerating minimal triangulations ⋮ Tree decomposition and discrete optimization problems: a survey ⋮ Treewidth computations. I: Upper bounds ⋮ Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs ⋮ Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs ⋮ Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions ⋮ On the structure of linear programs with overlapping cardinality constraints ⋮ A practical algorithm for making filled graphs minimal
This page was built for publication:
