On the minimum feasible graph for four sets (Q1908609): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Yin-Feng Xu / rank | |||
Property / author | |||
Property / author: Yin-Feng Xu / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3948568 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An optimization problem on graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matroids and Subset Interconnection Design / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3470484 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02662501 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2082423080 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:03, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the minimum feasible graph for four sets |
scientific article |
Statements
On the minimum feasible graph for four sets (English)
0 references
4 March 1996
0 references
feasible graph
0 references
spanning tree
0 references
NP-complete
0 references
polynomial-time solvable
0 references