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
The complexity of decomposing a graph into a matching and a..:
Banerjee, Agnijo
;
Marciano, João Pedro
;
Mond, Adva
..
http://arxiv.org/abs/2304.03256. , 2023
Link:
http://arxiv.org/abs/2304.03256
RT Journal T1
The complexity of decomposing a graph into a matching and a bounded linear forest
UL https://suche.suub.uni-bremen.de/peid=base-ftarxivpreprints:oai:arXiv.org:2304.03256&Exemplar=1&LAN=DE A1 Banerjee, Agnijo A1 Marciano, João Pedro A1 Mond, Adva A1 Petr, Jan A1 Portier, Julien YR 2023 K1 Computer Science - Computational Complexity K1 Mathematics - Combinatorics K1 68Q15 K1 68Q17 K1 68R10 K1 68R05 K1 05C70 JF http://arxiv.org/abs/2304.03256 LK http://arxiv.org/abs/2304.03256 DO http://arxiv.org/abs/2304.03256 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)