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
Querying Minimal Steiner Maximum-Connected Subgraphs in Lar..:
, In:
Proceedings of the 25th ACM International on Conference on Information and Knowledge Management
,
Hu, Jiafeng
;
Wu, Xiaowei
;
Cheng, Reynold
.. - p. 1241-1250 , 2016
Link:
https://dl.acm.org/doi/10.1145/2983323.2983748
RT T1 <cTitle>Proceedings of the 25th ACM International on Conference on Information and Knowledge Management</cTitle>: T1 <Title>Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs</Title> UL https://suche.suub.uni-bremen.de/peid=acm-2983748&Exemplar=1&LAN=DE A1 Hu, Jiafeng A1 Wu, Xiaowei A1 Cheng, Reynold A1 Luo, Siqiang A1 Fang, Yixiang PB ACM YR 2016 K1 community search K1 edge connectivity K1 graph query K1 steiner maximum-connected subgraph search K1 Information systems K1 Information systems applications K1 Data mining K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Graph algorithms SP 1241 OP 1250 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/2983323.2983748 DO https://dl.acm.org/doi/10.1145/2983323.2983748 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
