The Alcuin Number of a Graph (Q3541095): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A River-Crossing Problem in Cross-Cultural Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: The roots of combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4950119 / 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: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ferry Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizing the Wolf-Goat-Cabbage Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank

Latest revision as of 21:09, 28 June 2024

scientific article
Language Label Description Also known as
English
The Alcuin Number of a Graph
scientific article

    Statements

    The Alcuin Number of a Graph (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2008
    0 references
    transportation problem
    0 references
    scheduling
    0 references
    graph theory
    0 references

    Identifiers