"Efficiently computing k-edge connected components via graph decomposition."

Lijun Chang et al. (2013)

Details and statistics

DOI: 10.1145/2463676.2465323

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-04

a service of  Schloss Dagstuhl - Leibniz Center for Informatics