Sciweavers

    459 search results - page 14 / 92
    » Detecting induced subgraphs
    Sort
    View
    JGAA
    2007
    135views more  JGAA 2007»
    Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
    13 years 8 months ago
    Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
    Download  www.emis.de
    Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
    Donatello Conte, Pasquale Foggia, Mario Vento
    claim paper
    Read More »
    SIGCOMM
    2009
    ACM
    166views Communications» more  SIGCOMM 2009»
    A virtual network mapping algorithm based on subgraph isomorphism detection
    14 years 2 months ago
    A virtual network mapping algorithm based on subgraph isomorphism detection
    Download  conferences.sigcomm.org
    Assigning the resources of a virtual network to the components of a physical network, called Virtual Network Mapping, plays a central role in network virtualization. Existing appr...
    Jens Lischka, Holger Karl
    claim paper
    Read More »
    AMCS
    2008
    113views Mathematics» more  AMCS 2008»
    Inferring Graph Grammars by Detecting Overlap in Frequent Subgraphs
    13 years 8 months ago
    Inferring Graph Grammars by Detecting Overlap in Frequent Subgraphs
    Download  www.eecs.wsu.edu
    Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
    claim paper
    Read More »
    BIOINFORMATICS
    2004
    67views more  BIOINFORMATICS 2004»
    Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
    13 years 8 months ago
    Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
    Download  www.weizmann.ac.il
    Nadav Kashtan, Shalev Itzkovitz, Ron Milo, Uri Alo...
    claim paper
    Read More »
    JCP
    2008
    171views more  JCP 2008»
    Mining Frequent Subgraph by Incidence Matrix Normalization
    13 years 8 months ago
    Mining Frequent Subgraph by Incidence Matrix Normalization
    Download  www.academypublisher.com
    Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
    Jia Wu, Ling Chen
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.