Subgraph isomorphism problem

Results: 37



#Item
1Big 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

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

Add to Reading List

Source URL: cisrg.shef.ac.uk

Language: English - Date: 2016-07-11 10:00:44
2Service Retrieval Based on Behavioral Specification and Quality Requirements Daniela Grigori, Veronika Peralta, Mokrane Bouzeghoub PRISM, University of Versailles, France

Service Retrieval Based on Behavioral Specification and Quality Requirements Daniela Grigori, Veronika Peralta, Mokrane Bouzeghoub PRISM, University of Versailles, France

Add to Reading List

Source URL: bpm2005.loria.fr

Language: English - Date: 2005-09-12 10:45:10
3RAM: Randomized Approximate Graph Mining Based on Hashing

RAM: Randomized Approximate Graph Mining Based on Hashing

Add to Reading List

Source URL: i.cs.hku.hk

Language: English - Date: 2008-07-13 12:41:38
4Graphs and Homomorphisms  Our contribution Finding vertex-surjective graph homomorphisms Petr Golovach, Bernard Lidick´y,

Graphs and Homomorphisms Our contribution Finding vertex-surjective graph homomorphisms Petr Golovach, Bernard Lidick´y,

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2012-07-03 09:45:04
5JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015  Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek

JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2015-07-20 20:08:36
6December 15, :20 WSPC - Proceedings Trim Size: 9.75in x 6.5in

December 15, :20 WSPC - Proceedings Trim Size: 9.75in x 6.5in

Add to Reading List

Source URL: www.jsbi.org

Language: English - Date: 2008-12-14 21:22:09
7An algorithm for graph isomorphism and its application to KEGG Compound Search Nobuya Tanaka1   Susumu Goto

An algorithm for graph isomorphism and its application to KEGG Compound Search Nobuya Tanaka1 Susumu Goto

Add to Reading List

Source URL: www.jsbi.org

Language: English - Date: 2005-01-18 03:42:21
8Learning Attack Strategies from Intrusion Alerts∗ Peng Ning and Dingbang Xu Cyber Defense Laboratory Department of Computer Science North Carolina State University Raleigh, NC

Learning Attack Strategies from Intrusion Alerts∗ Peng Ning and Dingbang Xu Cyber Defense Laboratory Department of Computer Science North Carolina State University Raleigh, NC

Add to Reading List

Source URL: discovery.csc.ncsu.edu

Language: English - Date: 2011-11-09 13:26:01
9Learning Attack Strategies from Intrusion Alerts  ∗ Peng Ning

Learning Attack Strategies from Intrusion Alerts ∗ Peng Ning

Add to Reading List

Source URL: discovery.csc.ncsu.edu

Language: English - Date: 2011-11-09 13:26:02
10Dalke and Hastings Journal of Cheminformatics 2013, 5(Suppl 1):O6 http://www.jcheminf.com/content/5/S1/O6 ORAL PRESENTATION  Open Access

Dalke and Hastings Journal of Cheminformatics 2013, 5(Suppl 1):O6 http://www.jcheminf.com/content/5/S1/O6 ORAL PRESENTATION Open Access

Add to Reading List

Source URL: www.jcheminf.com

Language: English