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 bi-directional shortest path calculation speed up techniq..:
, In:
2022 7th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)
,
Koritsoglou, Kyriakos
;
Laskas, Petros
;
Patras, Vaios
... - p. 1-4 , 2022
Link:
https://doi.org/10.1109/SEEDA-CECNSM57760.2022.9932973
RT T1
2022 7th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)
: T1
A bi-directional shortest path calculation speed up technique for RDBMS
UL https://suche.suub.uni-bremen.de/peid=ieee-9932973&Exemplar=1&LAN=DE A1 Koritsoglou, Kyriakos A1 Laskas, Petros A1 Patras, Vaios A1 Boursianis, Achilles D. A1 Grigoriadis, Konstantinos A1 Fudos, Ioannis YR 2022 K1 Semantic Web K1 Solid modeling K1 Social networking (online) K1 Search methods K1 Roads K1 Relational databases K1 Bidirectional control K1 shortest path K1 relational databases K1 bidirectional graph search SP 1 OP 4 LK http://dx.doi.org/https://doi.org/10.1109/SEEDA-CECNSM57760.2022.9932973 DO https://doi.org/10.1109/SEEDA-CECNSM57760.2022.9932973 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)