Deakin University
Browse

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 Li
Finding maximal k-edge-connected subgraphs from a large graph

History

Event

Association for Computing Machinery. Conference (15th : 2012 : Berlin, Germany)

Pagination

480 - 491

Publisher

ACM Press

Location

Berlin, Germany

Start date

2012-03-27

End date

2012-03-30

ISBN-13

9781450307901

Publication classification

E1.1 Full written paper - refereed

Title of proceedings

EDBT '12: Proceedings of the 15th International Conference on Extending Database Technology

Usage metrics

    Research Publications

    Categories

    No categories selected

    Keywords

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC