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
Counting Thin Subgraphs via Packings Faster than Meet-in-th..:
Björklund, Andreas
;
Kaski, Petteri
;
Kowalik, Łukasz
ACM Transactions on Algorithms (TALG). 13 (2017) 4 - p. 1-26 , 2017
Link:
https://dl.acm.org/doi/10.1145/3125500
RT Journal T1
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time
UL https://suche.suub.uni-bremen.de/peid=acm-3125500&Exemplar=1&LAN=DE A1 Björklund, Andreas A1 Kaski, Petteri A1 Kowalik, Łukasz PB ACM YR 2017 SN 1549-6325 SN 1549-6333 K1 FPT algorithms K1 counting low pathwidth graphs K1 counting matchings K1 counting packings K1 counting paths K1 matrix multiplication K1 meet in the middle K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Graph algorithms K1 Theory of computation K1 Randomness, geometry and discrete structures JF ACM Transactions on Algorithms (TALG) VO 13 IS 4 SP 1 OP 26 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3125500 DO https://dl.acm.org/doi/10.1145/3125500 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)