scientific article; zbMATH DE number 219228
From MaRDI portal
Publication:4694712
zbMath0768.68121MaRDI QIDQ4694712
Hjálmtýr Hafsteinsson, Ton Kloks, John R. Gilbert, Hans L. Bodlaender
Publication date: 29 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
treewidthsparse matrix factorizationpathwidthapproximation algorithmsvertex separatorsalgorithm of Leightonminimum elimination tree heightminimum front size
Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Mixed deterministic and probabilistic networks ⋮ Search-space size in contraction hierarchies ⋮ Metric Embedding via Shortest Path Decompositions ⋮ Triangulating graphs without asteroidal triples ⋮ Parameterized complexity of fair feedback vertex set problem ⋮ Space saving by dynamic algebraization based on tree-depth ⋮ Triangulating multitolerance graphs ⋮ \(l_p\)-optimal rankings and max-optimal rankings are different ⋮ Rankings of graphs ⋮ Unnamed Item ⋮ An optimal parallel algorithm for node ranking of cographs ⋮ AND/OR search spaces for graphical models ⋮ AND/OR branch-and-bound search for combinatorial optimization in graphical models ⋮ On vertex ranking of a starlike graph
