File(s) under permanent embargo
Finding maximal k-edge-connected subgraphs from a large graph
Version 2 2024-06-05, 02:20
Version 1 2018-12-20, 19:21
conference contribution
posted on 2024-06-05, 02:20 authored by R Zhou, C Liu, JX Yu, W Liang, B Chen, Jianxin LiJianxin LiFinding maximal k-edge-connected subgraphs from a large graph
History
Pagination
480-491Location
Berlin, GermanyPublisher DOI
Start date
2012-03-27End date
2012-03-30ISBN-13
9781450307901Notes
timestamp: Tue, 06 Nov 2018 16:59:06 +0100 biburl: https://dblp.org/rec/bib/conf/edbt/ZhouLYLCL12 bibsource: dblp computer science bibliography, https://dblp.orgPublication classification
E1.1 Full written paper - refereedTitle of proceedings
EDBT '12: Proceedings of the 15th International Conference on Extending Database TechnologyEvent
Association for Computing Machinery. Conference (15th : 2012 : Berlin, Germany)Publisher
ACM PressUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC