Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal Bounds for the k -cut Problem

From MaRDI portal
Publication:5066939
Jump to:navigation, search

DOI10.1145/3478018OpenAlexW3216387773MaRDI QIDQ5066939

Jason Li, Anupam Gupta, Euiwoong Lee, David G. Harris

Publication date: 31 March 2022

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3478018


zbMATH Keywords

contraction algorithm\(k\)-cut


Mathematics Subject Classification ID

Computer science (68-XX)








This page was built for publication: Optimal Bounds for the k -cut Problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5066939&oldid=19557468"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 12:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki