Transfer flow graphs (Q1801698): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: an ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Interconnection of Circuit Modules in Microprocessor and Digital System Design / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)90488-f / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074061244 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:03, 30 July 2024

scientific article
Language Label Description Also known as
English
Transfer flow graphs
scientific article

    Statements

    Transfer flow graphs (English)
    0 references
    0 references
    20 June 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization problems
    0 references
    cograph
    0 references
    cliques
    0 references
    transfer flow graphs
    0 references
    compatibility graphs
    0 references
    clique problem
    0 references
    NP-complete
    0 references
    polynomial time
    0 references
    0 references