Login / Signup

Efficiently computing k-edge connected components via graph decomposition.

Lijun ChangJeffrey Xu YuLu QinXuemin LinChengfei LiuWeifa Liang
Published in: SIGMOD Conference (2013)
Keyphrases