The directed subgraph homeomorphism problem (Q1132111): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow Graph Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph / rank
 
Normal rank

Latest revision as of 02:30, 13 June 2024

scientific article
Language Label Description Also known as
English
The directed subgraph homeomorphism problem
scientific article

    Statements

    The directed subgraph homeomorphism problem (English)
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    directed graph
    0 references
    Np-complete
    0 references
    subgraph homeomorphism problem
    0 references
    directed pattern graph
    0 references

    Identifiers