@inproceedings{8b76a1261acd45b580fd799c03639b69,
title = "First steps in runtime analysis of worst-case execution time test generation for the Dijkstra algorithm using an evolutionary algorithm",
abstract = "This article describes our first steps in theoretical analysis of expected runtime of the (1 + 1) evolutionary algorithm that generates hard tests for the Dijkstra algorithm. The polynomial upper bound is proven for the case of extremely sparse graphs, and its precision is validated in experiments. Some ideas for the proof of another corner case, extremely dense graphs, are also given, along with an experimentally derived upper bound.",
keywords = "Evolutionary algorithms, Runtime analysis, Test generation",
author = "Denis Antipov and Maxim Buzdalov and Georgiy Korneev",
year = "2016",
language = "English",
series = "Mendel",
publisher = "Brno University of Technology",
pages = "43--48",
editor = "Matousek Radek",
booktitle = "MENDEL 2016 - 22nd International Conference on Soft Computing",
note = "22nd International Conference on Soft Computing: Evolutionary Computation, Genetic Programming, Swarm Intelligence, Fuzzy Logic, Neural Networks, Chaos, Bayesian Methods, Intelligent Image Processing, Bio-Inspired Robotics, MENDEL 2016 ; Conference date: 08-06-2016 Through 10-06-2016",
}