Efficient $K$-concern Matching in a Large Graph.

Lei Gai, Jian Li, Jie Shang, Xiaoming Wang

Browse the full ICNC paper archive.