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
Routing on the Shortest Pairs of Disjoint Paths:
, In:
2022 IFIP Networking Conference (IFIP Networking)
,
Babarczi, Peter
;
Retvari, Gabor
;
Ronyai, Lajos
. - p. 1-9 , 2022
Link:
https://doi.org/10.23919/IFIPNetworking55013.2022.9829..
RT T1
2022 IFIP Networking Conference (IFIP Networking)
: T1
Routing on the Shortest Pairs of Disjoint Paths
UL https://suche.suub.uni-bremen.de/peid=ieee-9829760&Exemplar=1&LAN=DE A1 Babarczi, Peter A1 Retvari, Gabor A1 Ronyai, Lajos A1 Tapolcai, Janos YR 2022 SN 1861-2288 K1 Focusing K1 Tagging K1 Routing K1 Data structures K1 Market research K1 Load management K1 Encoding K1 multi-path routing K1 Suurballe-Tarjan algorithm K1 data-plane scalability K1 incremental deployment SP 1 OP 9 LK http://dx.doi.org/https://doi.org/10.23919/IFIPNetworking55013.2022.9829760 DO https://doi.org/10.23919/IFIPNetworking55013.2022.9829760 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)