An efficient algorithm for solving the homogeneous set sandwich problem (Q1607076): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The homogeneous set sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ 4\)-trees and substitution decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank

Latest revision as of 12:05, 4 June 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for solving the homogeneous set sandwich problem
scientific article

    Statements

    An efficient algorithm for solving the homogeneous set sandwich problem (English)
    0 references
    0 references
    0 references
    0 references
    25 July 2002
    0 references
    0 references
    homogeneous set sandwich problem
    0 references