Grzegorz Herman - Academia.edu (original) (raw)

Uploads

Papers by Grzegorz Herman

In this work, we present the first linear time deterministic algorithm computing the 4-edge-conne... more In this work, we present the first linear time deterministic algorithm computing the 4-edge-connected components of an undirected graph. First, we show an algorithm listing all 3-edge-cuts in a given 3-edge-connected graph, and then we use the output of this algorithm in order to determine the 4-edge-connected components of the graph. 2012 ACM Subject Classification Theory of computation → Graph algorithms analysis

Fundamenta Informaticae, 2012

First of all, I would like to thank my supervisor, Dr. Michael Soltys. It was much thanks to him-... more First of all, I would like to thank my supervisor, Dr. Michael Soltys. It was much thanks to him-being not only an inspiring and patient advisor, but also a great person-that my years at McMaster were truly pleasant and enriching. The other members of my supervisory committee: Dr. Ryszard Janicki and Dr. Emil Sekerinski, as well as Prof. Stephen Cook, who has agreed to review my thesis, have all provided many valuable remarks. I am deeply grateful to my parents Izabel a and Krzysztof, and to my grandmother Zofia-I think it is simply not possible to overestimate the support and encouragement I have received from them. Many of my fiends also deserve my sincere thanks. In Poland: Lech, Ania and Michal, Marta, Patryk, Kasia, Ania, and of course Dominika, who has waited for me so patiently ... In Canada, I have been blessed to meet father Peter, Allan, Theresa and Elaine, Lauren and Due, Meghan, and many others. Thank you all for being there for me! IV

In this work, we present the first linear time deterministic algorithm computing the 4-edge-conne... more In this work, we present the first linear time deterministic algorithm computing the 4-edge-connected components of an undirected graph. First, we show an algorithm listing all 3-edge-cuts in a given 3-edge-connected graph, and then we use the output of this algorithm in order to determine the 4-edge-connected components of the graph. 2012 ACM Subject Classification Theory of computation → Graph algorithms analysis

Fundamenta Informaticae, 2012

First of all, I would like to thank my supervisor, Dr. Michael Soltys. It was much thanks to him-... more First of all, I would like to thank my supervisor, Dr. Michael Soltys. It was much thanks to him-being not only an inspiring and patient advisor, but also a great person-that my years at McMaster were truly pleasant and enriching. The other members of my supervisory committee: Dr. Ryszard Janicki and Dr. Emil Sekerinski, as well as Prof. Stephen Cook, who has agreed to review my thesis, have all provided many valuable remarks. I am deeply grateful to my parents Izabel a and Krzysztof, and to my grandmother Zofia-I think it is simply not possible to overestimate the support and encouragement I have received from them. Many of my fiends also deserve my sincere thanks. In Poland: Lech, Ania and Michal, Marta, Patryk, Kasia, Ania, and of course Dominika, who has waited for me so patiently ... In Canada, I have been blessed to meet father Peter, Allan, Theresa and Elaine, Lauren and Due, Meghan, and many others. Thank you all for being there for me! IV