NeMa: Fast Graph Search with Label Similarity Arijit Khan Yinghui Wu Charu C. Aggarwal Xifeng Yan Computer Science University of California, Santa Barbara IBM T. J. Watson Research

First Page		Document Content
Date: 2013-02-20 04:21:44 Graph operations Combinatorial optimization Subgraph isomorphism problem Matching Shortest path problem Line graph Belief propagation Graph Flow network Graph theory Mathematics Theoretical computer science		NeMa: Fast Graph Search with Label Similarity Arijit Khan Yinghui Wu Charu C. Aggarwal Xifeng Yan Computer Science University of California, Santa Barbara IBM T. J. Watson Research Add to Reading List Source URL: www.vldb.org Download Document from Source Website File Size: 326,03 KB Share Document on Facebook

	Big is Not Best – Maximum Common Substructure-based Similarity Searching Edmund Duesbury, John Holliday and Peter Willett Information School, University of Sheffield, Regent Court, 211 Portobello Street, Sheffield S1 4 DocID: 1qYOu - View Document
	Service Retrieval Based on Behavioral Specification and Quality Requirements Daniela Grigori, Veronika Peralta, Mokrane Bouzeghoub PRISM, University of Versailles, France DocID: 1qcOn - View Document
	RAM: Randomized Approximate Graph Mining Based on Hashing DocID: 1pFpQ - View Document
	Graphs and Homomorphisms Our contribution Finding vertex-surjective graph homomorphisms Petr Golovach, Bernard Lidick´y, DocID: 1oYQ2 - View Document
	JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek DocID: 1o6Ma - View Document