Local optimization of colorings of graphs (Q3780451): 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 preparation of examination time-tables using a small-store computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technique for colouring a graph applicable to large scale timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5720698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic proof technique for parallel programs / rank
 
Normal rank

Latest revision as of 15:30, 18 June 2024

scientific article
Language Label Description Also known as
English
Local optimization of colorings of graphs
scientific article

    Statements

    Identifiers