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...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Hua, Kevin, Li, Daniel, Park, Jaewoo, Saranurak, Thatchaphol
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 11.07.2024
Subjects:	Algorithms Connectivity Graph theory Local flow Office equipment Shredding
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!