A quasi self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given

Halina Bielak, Michal Panczyk. A quasi self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given. In Maria Ganzha, Leszek A. Maciaszek, Marcin Paprzycki, editors, Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, Kraków, Poland, September 8-11, 2013. pages 293-297, 2013.

Abstract

Abstract is missing.