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
Computing Critical Nodes in Directed Graphs:
Paudel, Nilakantha
;
Georgiadis, Loukas
;
Italiano, Giuseppe F.
Journal of Experimental Algorithmics (JEA). 23 (2018) 23 - p. 1-24 , 2018
Link:
https://dl.acm.org/doi/10.1145/3228332
RT Journal T1 <Title>Computing Critical Nodes in Directed Graphs</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3228332&Exemplar=1&LAN=DE A1 Paudel, Nilakantha A1 Georgiadis, Loukas A1 Italiano, Giuseppe F. PB ACM YR 2018 SN 1084-6654 SN 1084-6654 K1 Combinatorial optimization K1 NP-hard K1 critical nodes K1 directed graphs K1 strong articulation points K1 strong connectivity K1 Theory of computation K1 Design and analysis of algorithms K1 Approximation algorithms analysis K1 Routing and network design problems K1 Graph algorithms analysis K1 Mathematical optimization K1 Discrete optimization K1 Optimization with randomized search heuristics K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Graph algorithms K1 Network flows K1 Network optimization JF Journal of Experimental Algorithmics (JEA) VO 23 IS 23 SP 1 OP 24 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3228332 DO https://dl.acm.org/doi/10.1145/3228332 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
