Evolving Graph-Structures and Their Implicit Computational Complexity
From MaRDI portal
Publication:5327446
DOI10.1007/978-3-642-39212-2_32zbMath1334.68048OpenAlexW196419179MaRDI QIDQ5327446
Daniel Leivant, Jean-Yves Marion
Publication date: 7 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00939484/file/LeivantMarion.pdf
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ A type-based complexity analysis of object oriented programs ⋮ Algorithmically broad languages for polynomial time and space ⋮ Unnamed Item
This page was built for publication: Evolving Graph-Structures and Their Implicit Computational Complexity
