CECI
Authors:
Open Access
- 25 June 2019
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1447-1462
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (1350766, 1618706 and 1717774)
This publication has 41 references indexed in Scilit:
- LigraACM SIGPLAN Notices, 2013
- Inexact subgraph isomorphism in MapReduceJournal of Parallel and Distributed Computing, 2013
- Counting Stars and Other Small Subgraphs in Sublinear-TimeSIAM Journal on Discrete Mathematics, 2011
- Taming verification hardnessProceedings of the VLDB Endowment, 2008
- Biomolecular network motif counting and discovery by color codingBioinformatics, 2008
- Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking2007
- Efficient estimation of graphlet frequency distributions in protein–protein interaction networksBioinformatics, 2006
- A (sub)graph isomorphism algorithm for matching large graphsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- Dynamic processor self-scheduling for general parallel nested loopsIEEE Transactions on Computers, 1990
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976