Work

Minimum cut in directed planar networks

Year: 1992
Type: other
Abstract: LADISLAV JANIGA AND VÁCLAV KOUBEK An algorithm which for any planar directed network, with n nodes finds its minimum cut in time 0(n log (n)/ log(log(n))) is presented.For the case of s -^-network this time is reduced by the factor of log(n), i.e. to 0(nlog(n)/log(log(n))).
Language: English
Open Access status: green
OpenAlex ID: W2404615429
Cites: 8
Cited by: 17
Related to: 10