Graph coloring with rejection (Q632809): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The greedy algorithm is optimal for on-line edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chain and antichain families of a partially ordered set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and first fit colorings of graphs / 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: On-line coloring \(k\)-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved performance of the greedy algorithm for partial cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank

Latest revision as of 22:32, 3 July 2024

scientific article
Language Label Description Also known as
English
Graph coloring with rejection
scientific article

    Statements

    Graph coloring with rejection (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph coloring
    0 references
    approximation algorithms
    0 references
    online algorithms
    0 references
    0 references