On the complexity of the flow coloring problem (Q499367): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C21 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6487401 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
round weighting problem | |||
Property / zbMATH Keywords: round weighting problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
flow coloring | |||
Property / zbMATH Keywords: flow coloring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bipartite graphs | |||
Property / zbMATH Keywords: bipartite graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
NP-hardness | |||
Property / zbMATH Keywords: NP-hardness / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
inapproximability | |||
Property / zbMATH Keywords: inapproximability / rank | |||
Normal rank |
Revision as of 23:54, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of the flow coloring problem |
scientific article |
Statements
On the complexity of the flow coloring problem (English)
0 references
30 September 2015
0 references
round weighting problem
0 references
flow coloring
0 references
bipartite graphs
0 references
NP-hardness
0 references
inapproximability
0 references