The subgraph isomorphism problem for outerplanar graphs (Q1056237): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graphs with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4121921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Q4179030 / rank
 
Normal rank

Latest revision as of 09:34, 14 June 2024

scientific article
Language Label Description Also known as
English
The subgraph isomorphism problem for outerplanar graphs
scientific article

    Statements

    The subgraph isomorphism problem for outerplanar graphs (English)
    0 references
    1982
    0 references
    subgraph isomorphism problem
    0 references
    outerplanar graphs
    0 references
    NP-complete
    0 references
    planar graph
    0 references
    0 references

    Identifiers