Sciweavers

    796 search results - page 36 / 160
    » The Anonymous Subgraph Problem
    Sort
    View
    SODA
    2004
    ACM
    144views Algorithms» more  SODA 2004»
    Covering minimum spanning trees of random subgraphs
    13 years 11 months ago
    Covering minimum spanning trees of random subgraphs
    Download  www-math.mit.edu
    We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
    Michel X. Goemans, Jan Vondrák
    claim paper
    Read More »
    ECEASST
    2006
    305views more  ECEASST 2006»
    The ParMol Package for Frequent Subgraph Mining
    13 years 9 months ago
    The ParMol Package for Frequent Subgraph Mining
    Download  kops.ub.uni-konstanz.de
    Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
    Thorsten Meinl, Marc Wörlein, Olga Urzova, In...
    claim paper
    Read More »
    JGT
    2007
    68views more  JGT 2007»
    Forcing highly connected subgraphs
    13 years 9 months ago
    Forcing highly connected subgraphs
    Download  www.dim.uchile.cl
    A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
    Maya Jakobine Stein
    claim paper
    Read More »
    GD
    1995
    Springer
    128views Computer Graphics» more  GD 1995»
    Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons
    14 years 1 months ago
    Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons
    Download  pages.cpsc.ucalgary.ca
    It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
    M. Sheelagh T. Carpendale, David J. Cowperthwaite,...
    claim paper
    Read More »
    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 9 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 »
    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.