Evolving Graph-Structures and Their Implicit Computational Complexity

DOI10.1007/978-3-642-39212-2_32MaRDI QIDQ5327446zbMATH OpenOpenAlexFDO

Authors Daniel M. 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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Algorithms on evolving graphs
• scientific article; zbMATH DE number 3878974
• Evolutionary graph drawing algorithms
• Evolving graphs: dynamical models, inverse problems and propagation
• The Evolution of Random Graphs
• scientific article; zbMATH DE number 1792101
• scientific article; zbMATH DE number 3168330
• Evolutionary stability on graphs
• scientific article; zbMATH DE number 3902655

Cited in

(4)

• A type-based complexity analysis of object oriented programs
• \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
• Algorithmically broad languages for polynomial time and space
• A tier-based typed programming language characterizing feasible functionals

This page was built for publication: Evolving Graph-Structures and Their Implicit Computational Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5327446)