@inproceedings{2bdbf1f818714bf8b93a4def9facfcfe,
title = "Comparative study of representations in the maximum flow test generation problem",
abstract = "We consider the problem of generating, with the use of evolutionary algorithms, hard tests (that is, tests that maximize the running time) for the algorithms solving the well-known maximum flow problem. The main aim of this paper is to study the impact of the representation of the graph, in which the maximum flow is constructed. We consider three representations: the list of edges, the adjacency matrix, and the adjacency matrix with access to individual bits of capacities. Our study suggests that the list of edges is the best representation among the considered ones.",
keywords = "Evolutionary algorithms, Hard test generation, Maximum flow, Representations",
author = "Vladimir Mironovich and Maxim Buzdalov and Vladimir Parfenov",
year = "2016",
language = "English",
series = "Mendel",
publisher = "Brno University of Technology",
pages = "67--72",
editor = "Matousek Radek",
booktitle = "MENDEL 2016 - 22nd International Conference on Soft Computing",
address = "Czech Republic",
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",
}