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
Detecting k-Vertex Cuts in Sparse Networks via a Fast Local..:
Zhou, Yangming
;
Wang, Gezi
;
Zhou, MengChu
IEEE Transactions on Computational Social Systems. 11 (2024) 2 - p. 1832-1841 , 2024
Link:
https://doi.org/10.1109/tcss.2023.3238042
RT Journal T1 <Title>Detecting k-Vertex Cuts in Sparse Networks via a Fast Local Search Approach</Title> UL https://suche.suub.uni-bremen.de/peid=cr-10.1109_tcss.2023.3238042&Exemplar=1&LAN=DE A1 Zhou, Yangming A1 Wang, Gezi A1 Zhou, MengChu PB Institute of Electrical and Electronics Engineers (IEEE) YR 2024 SN 2329-924X SN 2373-7476 JF IEEE Transactions on Computational Social Systems VO 11 IS 2 SP 1832 OP 1841 LK http://dx.doi.org/https://doi.org/10.1109/tcss.2023.3238042 DO https://doi.org/10.1109/tcss.2023.3238042 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
