Computing a tree having a small vertex cover (Q2272400): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q2958305
aliases / en / 0aliases / en / 0
 
Computing a Tree Having a Small Vertex Cover
description / endescription / en
 
scientific article; zbMATH DE number 6679756
Property / title
 
Computing a Tree Having a Small Vertex Cover (English)
Property / title: Computing a Tree Having a Small Vertex Cover (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1436.68237 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-48749-6_6 / rank
 
Normal rank
Property / published in
 
Property / published in: Combinatorial Optimization and Applications / rank
 
Normal rank
Property / publication date
 
1 February 2017
Timestamp+2017-02-01T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 1 February 2017 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6679756 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2545708558 / rank
 
Normal rank

Revision as of 08:52, 6 May 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
  • Computing a Tree Having a Small Vertex Cover

Statements

Computing a tree having a small vertex cover (English)
0 references
Computing a Tree Having a Small Vertex Cover (English)
0 references
0 references
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

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references