scientific article
From MaRDI portal
Publication:3197842
zbMath0713.05025MaRDI QIDQ3197842
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Related Items (15)
Treewidth of cocomparability graphs and a new order-theoretic parameter ⋮ Drawing Halin-graphs with small height ⋮ Memory requirements for table computations in partial k-tree algorithms ⋮ Triangulating graphs without asteroidal triples ⋮ On the thinness and proper thinness of a graph ⋮ Separating layered treewidth and row treewidth ⋮ A distributed algorithm for computing the node search number in trees ⋮ Narrowness, pathwidth, and their application in natural language processing ⋮ Mixed searching and proper-path-width ⋮ Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width) ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ Horton-Strahler number, rooted pathwidth and upward drawings of trees ⋮ Edge and node searching problems on trees ⋮ Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results ⋮ Minimal acyclic forbidden minors for the family of graphs with bounded path-width
This page was built for publication:
