10 citations · 19 across the 18 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
Compact Cactus Representations of all Non-Trivial Min-Cuts
On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup
Recently, Kawarabayashi and Thorup presented the first deterministic edge-connectivity recognition algorithm in near-linear time. A crucial step in their algorithm uses the existen…
math.CO2018
On the Circumference of Essentially 4-connected Planar Graphs
Igor Fabrici, Jochen Harant, Samuel Mohr +1
A planar graph is essentially -connected if it is 3-connected and every of its 3-separators is the neighborhood of a single vertex. Jackson and Wormald proved that every essenti…