On the minimum average distance spanning tree of the hypercube (Q934836): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10440-008-9215-5 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10440-008-9215-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037653778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjecture on Wiener indices in combinatorial chemistry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4487453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate algorithms for optimal network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wiener index of trees: Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4351067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for minimum routing cost trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient methods for multiple sequence alignment with guaranteed error bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Approach to the Selection of an Optimal Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Network Design Problem Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the shortest total path length spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10440-008-9215-5 / rank
 
Normal rank

Latest revision as of 08:48, 10 December 2024

scientific article
Language Label Description Also known as
English
On the minimum average distance spanning tree of the hypercube
scientific article

    Statements

    On the minimum average distance spanning tree of the hypercube (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 July 2008
    0 references
    Minimum average distance
    0 references
    Spanning tree
    0 references
    Hypercube
    0 references
    Binomial tree
    0 references
    1-move heuristic
    0 references
    Local optimality
    0 references
    Greedy algorithm
    0 references
    Torus
    0 references

    Identifiers