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
An Optimal O(nm) Algorithm for Enumerating All Walks Common..:
Cairo, Massimo
;
Medvedev, Paul
;
Acosta, Nidia Obscura
..
ACM Transactions on Algorithms (TALG). 15 (2019) 4 - p. 1-17 , 2019
Link:
https://dl.acm.org/doi/10.1145/3341731
RT Journal T1
An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph
UL https://suche.suub.uni-bremen.de/peid=acm-3341731&Exemplar=1&LAN=DE A1 Cairo, Massimo A1 Medvedev, Paul A1 Acosta, Nidia Obscura A1 Rizzi, Romeo A1 Tomescu, Alexandru I. PB ACM YR 2019 SN 1549-6325 SN 1549-6333 K1 Genome assembly K1 edge-covering walk K1 graph algorithm K1 safe and complete algorithm K1 strong bridge K1 Applied computing K1 Life and medical sciences K1 Bioinformatics K1 Theory of computation K1 Design and analysis of algorithms K1 Graph algorithms analysis JF ACM Transactions on Algorithms (TALG) VO 15 IS 4 SP 1 OP 17 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3341731 DO https://dl.acm.org/doi/10.1145/3341731 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)