Transforming spanning trees: A lower bound (Q1028225): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import recommendations run Q6767936
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.comgeo.2008.03.005 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.COMGEO.2008.03.005 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Transforming spanning trees and pseudo-triangulations / rank
 
Normal rank
Property / Recommended article: Transforming spanning trees and pseudo-triangulations / qualifier
 
Similarity Score: 0.9241619
Amount0.9241619
Unit1
Property / Recommended article: Transforming spanning trees and pseudo-triangulations / qualifier
 
Property / Recommended article
 
Property / Recommended article: Spanning tree with lower bound on the degrees / rank
 
Normal rank
Property / Recommended article: Spanning tree with lower bound on the degrees / qualifier
 
Similarity Score: 0.9011893
Amount0.9011893
Unit1
Property / Recommended article: Spanning tree with lower bound on the degrees / qualifier
 
Property / Recommended article
 
Property / Recommended article: Lower-Stretch Spanning Trees / rank
 
Normal rank
Property / Recommended article: Lower-Stretch Spanning Trees / qualifier
 
Similarity Score: 0.9006946
Amount0.9006946
Unit1
Property / Recommended article: Lower-Stretch Spanning Trees / qualifier
 
Property / Recommended article
 
Property / Recommended article: Lower-stretch spanning trees / rank
 
Normal rank
Property / Recommended article: Lower-stretch spanning trees / qualifier
 
Similarity Score: 0.9006946
Amount0.9006946
Unit1
Property / Recommended article: Lower-stretch spanning trees / qualifier
 
Property / Recommended article
 
Property / Recommended article: Lower bounds on treespan / rank
 
Normal rank
Property / Recommended article: Lower bounds on treespan / qualifier
 
Similarity Score: 0.89156634
Amount0.89156634
Unit1
Property / Recommended article: Lower bounds on treespan / qualifier
 
Property / Recommended article
 
Property / Recommended article: Lower and upper bounds for the spanning tree with minimum branch vertices / rank
 
Normal rank
Property / Recommended article: Lower and upper bounds for the spanning tree with minimum branch vertices / qualifier
 
Similarity Score: 0.88989663
Amount0.88989663
Unit1
Property / Recommended article: Lower and upper bounds for the spanning tree with minimum branch vertices / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5461426 / rank
 
Normal rank
Property / Recommended article: Q5461426 / qualifier
 
Similarity Score: 0.8880092
Amount0.8880092
Unit1
Property / Recommended article: Q5461426 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Lower bounds on the number of leaves in spanning trees / rank
 
Normal rank
Property / Recommended article: Lower bounds on the number of leaves in spanning trees / qualifier
 
Similarity Score: 0.883031
Amount0.883031
Unit1
Property / Recommended article: Lower bounds on the number of leaves in spanning trees / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the combinatorial lower bound for the extension complexity of the spanning tree polytope / rank
 
Normal rank
Property / Recommended article: On the combinatorial lower bound for the extension complexity of the spanning tree polytope / qualifier
 
Similarity Score: 0.8793855
Amount0.8793855
Unit1
Property / Recommended article: On the combinatorial lower bound for the extension complexity of the spanning tree polytope / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q6059174 / rank
 
Normal rank
Property / Recommended article: Q6059174 / qualifier
 
Similarity Score: 0.87687135
Amount0.87687135
Unit1
Property / Recommended article: Q6059174 / qualifier
 

Latest revision as of 16:34, 4 April 2025

scientific article
Language Label Description Also known as
English
Transforming spanning trees: A lower bound
scientific article

    Statements

    Transforming spanning trees: A lower bound (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2009
    0 references
    crossing-free geometric graphs
    0 references
    compatible spanning trees
    0 references
    transformation graphs
    0 references

    Identifiers