On maximum common subgraph problems in series-parallel graphs (Q1678090): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q115926592, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tighter insertion-based approximation of the crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and parallel algorithms for embedding problems on classes of partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of subgraph isomorphism for classes of partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient frequent connected subgraph mining in graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximum Common Subgraph Problems in Series-Parallel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree Isomorphism in O(n5/2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-disjoint paths problem is NP-complete for series-parallel graphs / 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: A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subgraph isomorphism problem for outerplanar graphs / rank
 
Normal rank

Latest revision as of 17:03, 14 July 2024

scientific article
Language Label Description Also known as
English
On maximum common subgraph problems in series-parallel graphs
scientific article

    Statements

    On maximum common subgraph problems in series-parallel graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 November 2017
    0 references
    series-parallel graphs
    0 references
    polynomial time algorithm
    0 references

    Identifiers

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