An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6588281 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph coloring
Property / zbMATH Keywords: graph coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
analysis of algorithms
Property / zbMATH Keywords: analysis of algorithms / rank
 
Normal rank

Revision as of 19:36, 27 June 2023

scientific article
Language Label Description Also known as
English
An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
scientific article

    Statements

    An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (English)
    0 references
    0 references
    0 references
    1 June 2016
    0 references
    graph coloring
    0 references
    approximation algorithms
    0 references
    analysis of algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references