scientific article; zbMATH DE number 512817

zbMath0799.68113MaRDI QIDQ4281510

Dieter Kratsch, Ton Kloks

Publication date: 10 March 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treewidthpolynomial time algorithmchordal bipartite graphsmaximum cliquesize

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On strictly chordality-\(k\) graphs ⋮ Treewidth and pathwidth of permutation graphs ⋮ Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph ⋮ Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds