``Global'' graph problems tend to be intractable (Q1820581): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Information transfer and area-time tradeoffs for VLSI multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transitive Reduction of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3277097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separator theorem for graphs of bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for a Minimum Cover of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010349 / rank
 
Normal rank

Latest revision as of 18:17, 17 June 2024

scientific article
Language Label Description Also known as
English
``Global'' graph problems tend to be intractable
scientific article

    Statements

    ``Global'' graph problems tend to be intractable (English)
    0 references
    0 references
    0 references
    1986
    0 references
    measure of globality
    0 references
    information-flow complexity
    0 references
    intractable problems
    0 references
    vertex cover
    0 references
    graph 3-colorability
    0 references
    Hamiltonian circuit
    0 references
    NP-complete problems
    0 references
    edge cover
    0 references
    graph 2-colorability
    0 references
    Eulerian circuit
    0 references
    problems in P
    0 references

    Identifiers