Computing a tree having a small vertex cover (Q2272400): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127826239, #quickstatements; #temporary_batch_1722428282777 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2019.05.018 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2019.05.018 / rank | |||
Normal rank | |||
Latest revision as of 11:06, 28 December 2024
scientific article; zbMATH DE number 6679756
- Computing a Tree Having a Small Vertex Cover
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a tree having a small vertex cover |
scientific article; zbMATH DE number 6679756 |
|
Statements
Computing a tree having a small vertex cover (English)
0 references
Computing a Tree Having a Small Vertex Cover (English)
0 references
10 September 2019
0 references
1 February 2017
0 references
Steiner tree
0 references
unit disk graph
0 references
minor-free graph
0 references
0 references
0 references
0 references
