Computing inductive vertex orderings (Q2234785): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Split Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum independent set of pseudo-disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich theorem / rank
 
Normal rank

Revision as of 20:16, 26 July 2024

scientific article
Language Label Description Also known as
English
Computing inductive vertex orderings
scientific article

    Statements

    Computing inductive vertex orderings (English)
    0 references
    0 references
    19 October 2021
    0 references
    approximation algorithms
    0 references
    inductive independence
    0 references
    simplicial ordering
    0 references
    perfectly orientable
    0 references
    computing ordering
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references