Subgraph isomorphism for biconnected outerplanar graphs in cubic time (Q1823708): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3719847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree Isomorphism in O(n5/2) / 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: An Analysis of a Good Algorithm for the Subtree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subgraph isomorphism problem for outerplanar graphs / rank
 
Normal rank

Revision as of 09:45, 20 June 2024

scientific article
Language Label Description Also known as
English
Subgraph isomorphism for biconnected outerplanar graphs in cubic time
scientific article

    Statements

    Subgraph isomorphism for biconnected outerplanar graphs in cubic time (English)
    0 references
    0 references
    1989
    0 references
    subgraph isomorphism
    0 references
    outerplanar graphs
    0 references
    dynamic programming algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references