Optimal greedy algorithms for indifference graphs (Q2365550): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3898496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal greedy heuristic to color interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiorders and a Theory of Utility Discrimination / rank
 
Normal rank

Latest revision as of 17:59, 17 May 2024

scientific article
Language Label Description Also known as
English
Optimal greedy algorithms for indifference graphs
scientific article

    Statements

    Optimal greedy algorithms for indifference graphs (English)
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    indifference
    0 references
    greedy algorithms
    0 references
    coloring
    0 references
    shortest path
    0 references
    maximum matching
    0 references
    center
    0 references
    Hamiltonian path
    0 references

    Identifiers