scientific article; zbMATH DE number 1926662
From MaRDI portal
Publication:4707790
zbMath1014.68883MaRDI QIDQ4707790
Jens Gustedt, Jan Arne Telle, Ole A. Mæhle
Publication date: 11 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2409/24090086.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Graph theory (including graph drawing) in computer science (68R10) Theory of programming languages (68N15) Computing methodologies and applications (68U99)
Related Items (9)
Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ The tree-width of C ⋮ Pushdown reachability with constant treewidth ⋮ Efficient interprocedural data-flow analysis using treedepth and treewidth ⋮ The complexity of register allocation ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Bounded treewidth as a key to tractability of knowledge representation and reasoning ⋮ Tree-decompositions of small pathwidth ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs
This page was built for publication:
