Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation (Q5405060): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5741821
 
aliases / en / 0aliases / en / 0
 
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More
description / endescription / en
 
scientific article; zbMATH DE number 7055347
Property / title
 
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More (English)
Property / title: Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1423.05140 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/1.9781611973105.112 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms / rank
 
Normal rank
Property / publication date
 
15 May 2019
Timestamp+2019-05-15T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 15 May 2019 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7055347 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2950544775 / rank
 
Normal rank

Latest revision as of 10:24, 6 May 2024

scientific article; zbMATH DE number 7055347
  • Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More
Language Label Description Also known as
English
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
scientific article; zbMATH DE number 7055347
  • Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More

Statements

Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation (English)
0 references
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More (English)
0 references
0 references
0 references
0 references
0 references
0 references
31 March 2014
0 references
15 May 2019
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references