Biblio
Export 4 results:
Filters: Author is Lijun Chang [Clear All Filters]
"Efficiently computing k-edge connected components via graph decomposition", SIGMOD Conference: ACM, pp. 205-216, 2013.
, "Fast Maximal Cliques Enumeration in Sparse Graphs", Algorithmica, vol. 66, no. 1, pp. 173-186, 2013.
, "The exact distance to destination in undirected world", VLDB J., vol. 21, no. 6, pp. 869-888, 2012.
, "Finding information nebula over large networks", CIKM, pp. 1465-1474, 2011.
,