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
Listing All Maximal k-Plexes in Temporal Graphs:
Bentert, Matthias
;
Himmel, Anne-Sophie
;
Molter, Hendrik
...
Journal of Experimental Algorithmics (JEA). 24 (2019) 24 - p. 1-27 , 2019
Link:
https://dl.acm.org/doi/10.1145/3325859
RT Journal T1 <Title>Listing All Maximal k-Plexes in Temporal Graphs</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3325859&Exemplar=1&LAN=DE A1 Bentert, Matthias A1 Himmel, Anne-Sophie A1 Molter, Hendrik A1 Morik, Marco A1 Niedermeier, Rolf A1 Saitenmacher, René PB ACM YR 2019 SN 1084-6654 SN 1084-6654 K1 Social network analysis K1 community detection K1 data science K1 degeneracy K1 experimental analysis K1 link streams K1 temporal cliques K1 time-varying networks K1 Theory of computation K1 Design and analysis of algorithms K1 Graph algorithms analysis K1 Mathematics of computing K1 Discrete mathematics K1 Combinatorics K1 Combinatorial algorithms K1 Enumeration K1 Parameterized complexity and exact algorithms K1 Fixed parameter tractability JF Journal of Experimental Algorithmics (JEA) VO 24 IS 24 SP 1 OP 27 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3325859 DO https://dl.acm.org/doi/10.1145/3325859 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
