On the Connection between Interval Size Functions and Path Counting
From MaRDI portal
Publication:3630195
DOI10.1007/978-3-642-02017-9_14zbMath1241.68067OpenAlexW2162737436MaRDI QIDQ3630195
Aris Tentes, Andreas Göbel, Aris Pagourtzis, Evangelos Bampas
Publication date: 3 June 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_14
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
This page was built for publication: On the Connection between Interval Size Functions and Path Counting