I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Gra..:
, In:
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
,
Li, Jason
;
Panigrahi, Debmalya
;
Saranurak, Thatchaphol
- p. 1124-1134 , 2022
Link:
https://doi.org/10.1109/FOCS52979.2021.00111
RT T1
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
: T1
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs
UL https://suche.suub.uni-bremen.de/peid=ieee-9719859&Exemplar=1&LAN=DE A1 Li, Jason A1 Panigrahi, Debmalya A1 Saranurak, Thatchaphol YR 2022 SN 2575-8454 K1 Computer science K1 Costs K1 Gomory Hu tree K1 Expander decomposition SP 1124 OP 1134 LK http://dx.doi.org/https://doi.org/10.1109/FOCS52979.2021.00111 DO https://doi.org/10.1109/FOCS52979.2021.00111 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)