COMPUTER SCIENCE COLLOQUIUM

Certifying High Connectivity

Matthias Kriesell Arbeitsgruppe Diskrete Mathematik und Algebra TU Ilmenau

Tuesday, 18 September, 2018 at 14:15 IMADA's Seminar Room

ABSTRACT

An edge in a k-connected graph is k-contractible, if the graph obtained by identifying its endpoints remains k-connected. We survey some recent results on the distribution of k-contractible edges along DFS trees and other substructures, and indicate why these could be useful in the design of algorithms certifying k-connectedness.

Host: Jørgen Bang Jensen

---

SDU HOME | IMADA HOME | Previous Page

---

Daniel Merkle