Sorrachai Yingchareonthawornchai

activity

20162026

most citedComputing and Testing Small Vertex Connectivity in Near-Linear Time and Queries

6 citations · 20 across the 19 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Vertex Connectivity in Poly-logarithmic Max-flows

Jason Li, Danupon Nanongkai, Debmalya Panigrahi +2

The vertex connectivity of an $m$ -edge $n$ -vertex undirected graph is the smallest number of vertices whose removal disconnects the graph, or leaves only a singleton vertex. In thi…

cs.DS2021

Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity

Max Franck, Sorrachai Yingchareonthawornchai

Vertex connectivity is a well-studied concept in graph theory with numerous applications. A graph is $k$ -connected if it remains connected after removing any $k - 1$ vertices. The ve…