Faster algorithms for quantitative verification in constant treewidth graphs

DOI10.1007/978-3-319-21690-4_9zbMath1381.68150arXiv1504.07384OpenAlexW854382448MaRDI QIDQ1702915

Andreas Pavlogiannis, Rasmus Ibsen-Jensen, Krishnendu Chatterjee

Publication date: 1 March 2018

Full work available at URL: https://arxiv.org/abs/1504.07384

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Efficient interprocedural data-flow analysis using treedepth and treewidth ⋮ Automated competitive analysis of real-time scheduling with graph games ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs

This page was built for publication: Faster algorithms for quantitative verification in constant treewidth graphs