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
On the Complexity of String Matching for Graphs:
Equi, Massimo
;
Mäkinen, Veli
;
Tomescu, Alexandru I
.
10.1145/3588334. , 2023
Link:
http://hdl.handle.net/10138/563618
RT Journal T1
On the Complexity of String Matching for Graphs
UL https://suche.suub.uni-bremen.de/peid=base-ftunivhelsihelda:oai:helda.helsinki.fi:10138_563618&Exemplar=1&LAN=DE A1 Equi, Massimo A1 Mäkinen, Veli A1 Tomescu, Alexandru I A1 Grossi, Roberto PB ASSOC COMPUTING MACHINERY YR 2023 K1 graph query K1 variation graphs K1 graph search K1 string search K1 labeled graphs K1 Exact pattern matching K1 Strong Exponential Time Hypothesis K1 heterogeneous networks K1 string matching K1 Computer and information sciences JF 10.1145/3588334 LK http://hdl.handle.net/10138/563618 DO http://hdl.handle.net/10138/563618 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)