A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: AFGen / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: gSpan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963920197 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q115926710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Video indexing and similarity retrieval by largest common subgraph detection using decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph distance metric based on the maximal common subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical and Relational Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for Structured Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack search algorithms and the maximal common subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating all connected maximal common subgraphs in two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Subtree Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph isomorphism for biconnected outerplanar graphs in cubic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithms to recognize outerplanar and maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective feature construction by maximum common subgraph sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subgraph isomorphism problem for outerplanar graphs / rank
 
Normal rank

Latest revision as of 16:04, 8 July 2024

scientific article
Language Label Description Also known as
English
A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
scientific article

    Statements

    A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2014
    0 references
    metrics for structured data
    0 references
    graph mining
    0 references
    chemoinformatics
    0 references
    learning structure-activity relationships
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references