Graphana - A tool for measuring graph parameters
Andreas Fender, B.Sc. (TU Berlin)
The very heart of parameterized algorithmics lies in the idea to confine (unavoidable) combinatorial explosions to a parameter. The smaller the parameter is the faster the corresponding parameterized algorithm is. Thus, in practice an important step before developing parameterized algorithms is to identify parameters that are small in the respective setting. We developed the software tool "Graphana" being capable to measure the most common graph parameters for a set of given graphs, thus, providing a basis for deciding which parameters to be investigated. In this talk I present Graphana, show how to use and how to enhance it.
Back to the research colloquium site.