dr hab. Paweł Pilarczyk
Employment
Social media
Contact
 pawel.pilarczyk@pg.edu.pl
Professor
 Department of Differential Equations and Mathematical Applications
 Faculty of Applied Physics and Mathematics
 Workplace

Gmach B
pokój 610A open in new tab  Phone
 +48583472263
 pawel.pilarczyk@pg.edu.pl
Publication showcase

A spaceefficient algorithm for computing the minimum cycle mean in a directed graph
An algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.

An algorithmic approach to estimating the minimal number of periodic points for smooth selfmaps of simplyconnected manifolds
For a given selfmap f of M, a closed smooth connected and simplyconnected manifold of dimension m 4, we provide an algorithm for estimating the values of the topological invariant D^m_r [f], which equals the minimal number of rperiodic points in the smooth homotopy class of f. Our results are based on the combinatorial scheme for computing D^m_r [f] introduced by G. Graff and J. Jezierski [J. Fixed Point Theory Appl. 13 (2013),...
seen 205 times