On approximating tree spanners that are breadth first search trees (Q269500): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6570316 / rank
 
Normal rank
Property / zbMATH Keywords
 
tree spanner
Property / zbMATH Keywords: tree spanner / rank
 
Normal rank
Property / zbMATH Keywords
 
low stretch
Property / zbMATH Keywords: low stretch / rank
 
Normal rank
Property / zbMATH Keywords
 
hardness of approximation
Property / zbMATH Keywords: hardness of approximation / rank
 
Normal rank
Property / zbMATH Keywords
 
spanning tree
Property / zbMATH Keywords: spanning tree / rank
 
Normal rank
Property / zbMATH Keywords
 
distance
Property / zbMATH Keywords: distance / rank
 
Normal rank

Revision as of 15:13, 27 June 2023

scientific article
Language Label Description Also known as
English
On approximating tree spanners that are breadth first search trees
scientific article

    Statements

    On approximating tree spanners that are breadth first search trees (English)
    0 references
    18 April 2016
    0 references
    tree spanner
    0 references
    low stretch
    0 references
    hardness of approximation
    0 references
    spanning tree
    0 references
    distance
    0 references

    Identifiers