Mathematical Foundations of Computer Science 2003
From MaRDI portal
Publication:5431334
DOI10.1007/b11836zbMath1124.68373OpenAlexW2495578842MaRDI QIDQ5431334
Publication date: 7 December 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11836
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Trees, grids, and MSO decidability: from graphs to matroids ⋮ Tree automata and pigeonhole classes of matroids. I ⋮ Vertex-minors, monadic second-order logic, and a conjecture by Seese ⋮ A Simpler Self-reduction Algorithm for Matroid Path-Width ⋮ Decomposition width of matroids ⋮ Yes, the “missing axiom” of matroid theory is lost forever ⋮ Monadic second-order model-checking on decomposable matroids ⋮ Branch-width, parse trees, and monadic second-order logic for matroids. ⋮ Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming ⋮ Graph decompositions definable in monadic second-order logic
This page was built for publication: Mathematical Foundations of Computer Science 2003
