Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time

We show the first near-linear time randomized algorithms for listing all minimum vertex cuts of polylogarithmic size that separate the graph into at least three connected components (also known as shredders) and for finding the most shattering one, i.e., the one maximizing the number of connected co...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Hua, Kevin, Li, Daniel, Park, Jaewoo, Saranurak, Thatchaphol
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 11.07.2024
Predmet:	Algorithms Connectivity Graph theory Local flow Office equipment Shredding
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!