Packing cycles exactly in polynomial time (Q421271): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Xu-jin Chen / 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: 90C35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6038107 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
packing and covering | |||
Property / zbMATH Keywords: packing and covering / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
polynomial algorithm | |||
Property / zbMATH Keywords: polynomial algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
min-max relation | |||
Property / zbMATH Keywords: min-max relation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
maximum cycle packing | |||
Property / zbMATH Keywords: maximum cycle packing / rank | |||
Normal rank |
Revision as of 20:44, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Packing cycles exactly in polynomial time |
scientific article |
Statements
Packing cycles exactly in polynomial time (English)
0 references
23 May 2012
0 references
packing and covering
0 references
polynomial algorithm
0 references
min-max relation
0 references
maximum cycle packing
0 references