scientific article

From MaRDI portal
Publication:3812222

zbMath0662.03030MaRDI QIDQ3812222

Stefan Arnborg, Jens Lagergren, Detlef Seese

Publication date: 1988


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



Related Items (25)

Trees, grids, and MSO decidability: from graphs to matroidsThe nonexistence of reduction rules giving an embedding into a \(k\)-treeRegularity and locality in \(k\)-terminal graphsThe monadic second-order logic of graphs. I: Recognizable sets of finite graphsGeneralized coloring for tree-like graphsTree clustering for constraint networksEfficient algorithms for solving systems of linear equations and path problemsDecomposition width of matroidsNC-algorithms for graphs with small treewidthUndecidability of the bandwidth problem on linear graph languagesThe monadic second-order logic of graphs. V: On closing the gap between definability and recognizabilityA regular characterization of graph languages definable in monadic second-order logicAutomatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph familiesGeneral vertex disjoint paths in series-parallel graphsOn parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-widthBranch-width, parse trees, and monadic second-order logic for matroids.Power indices and easier hard problemsUnnamed ItemAchromatic number is NP-complete for cographs and interval graphsGenerating irregular partitionable data structuresOn hyperedge replacement and BNLC graph grammarsSteiner's problem in double treesThe structure of the models of decidable monadic theories of graphsBibliography on domination in graphs and some basic definitions of domination parametersThe Steiner tree polytope and related polyhedra




This page was built for publication: