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
Efficient Sink-Reachability Analysis via Graph Reduction:
Dietrich, Jens
;
Chang, Lijun
;
Qian, Long
...
IEEE Transactions on Knowledge and Data Engineering. 34 (2022) 11 - p. 5321-5335 , 2022
Link:
https://doi.org/10.1109/tkde.2021.3052710
RT Journal T1
Efficient Sink-Reachability Analysis via Graph Reduction
UL https://suche.suub.uni-bremen.de/peid=cr-10.1109_tkde.2021.3052710&Exemplar=1&LAN=DE A1 Dietrich, Jens A1 Chang, Lijun A1 Qian, Long A1 Henry, Lyndon M. A1 McCartin, Catherine A1 Scholz, Bernhard PB Institute of Electrical and Electronics Engineers (IEEE) YR 2022 SN 1041-4347 SN 1558-2191 SN 2326-3865 JF IEEE Transactions on Knowledge and Data Engineering VO 34 IS 11 SP 5321 OP 5335 LK http://dx.doi.org/https://doi.org/10.1109/tkde.2021.3052710 DO https://doi.org/10.1109/tkde.2021.3052710 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)