scientific article; zbMATH DE number 4121438
From MaRDI portal
Publication:4734768
zbMath0684.68061MaRDI QIDQ4734768
Publication date: 1989
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)
Related Items (22)
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations ⋮ Bounding the search number of graph products ⋮ Treewidth of cocomparability graphs and a new order-theoretic parameter ⋮ A polynomial time algorithm for strong edge coloring of partial \(k\)-trees ⋮ The pathwidth and treewidth of cographs ⋮ A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ Graph drawings with few slopes ⋮ Generalized coloring for tree-like graphs ⋮ Between clique-width and linear clique-width of bipartite graphs ⋮ Triangulating multitolerance graphs ⋮ Approximating Pathwidth for Graphs of Small Treewidth ⋮ Induced subgraphs and path decompositions ⋮ How to compute digraph width measures on directed co-graphs ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Neighbourhood-width of trees ⋮ Complexity of path-forming games ⋮ Using decomposition-parameters for QBF: mind the prefix! ⋮ A partial k-arboretum of graphs with bounded treewidth ⋮ On the pathwidth of chordal graphs ⋮ Linear rank-width and linear clique-width of trees ⋮ Steiner's problem in double trees ⋮ The structure of the models of decidable monadic theories of graphs
This page was built for publication:
