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 2012-07-10, 00:00 authored by R Zhou, C Liu, J X Yu, W Liang, B Chen, Jianxin LiFinding maximal k-edge-connected subgraphs from a large graph
History
Event
Association for Computing Machinery. Conference (15th : 2012 : Berlin, Germany)Pagination
480 - 491Publisher
ACM PressLocation
Berlin, GermanyPublisher DOI
Start date
2012-03-27End date
2012-03-30ISBN-13
9781450307901Publication classification
E1.1 Full written paper - refereedTitle of proceedings
EDBT '12: Proceedings of the 15th International Conference on Extending Database TechnologyUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC