On the k -ary hypercube tree and its average distance

By Alsuwaiyel M. H.  

International Journal of Computer Mathematics, Vol. 88, Iss. 11, 2011-07 ,pp. : 2258-2274

Taylor & Francis Ltd

Access to resources Recommend Favorite

Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in {mathbb R}^n

By Paolini E.   Stepanov E.  

Journal of Mathematical Sciences, Vol. 122, Iss. 3, 2004-07 ,pp. : 3290-3309

Springer Publishing Company

Access to resources Recommend Favorite

Rainbows in the Hypercube

By Axenovich Maria   Harborth Heiko   Kemnitz Arnfried   Möller Meinhard   Schiermeyer Ingo  

Graphs and Combinatorics, Vol. 23, Iss. 2, 2007-04 ,pp. : 123-133

Springer Publishing Company

Access to resources Recommend Favorite

Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance

By He Yong   Zhang Binwu   Yao Enyu  

Journal of Combinatorial Optimization, Vol. 9, Iss. 1, 2005-02 ,pp. : 91-100

Springer Publishing Company

Access to resources Recommend Favorite

Applying an edit distance to the matching of tree ring sequences in dendrochronology

By Wenk C.  

Journal of Discrete Algorithms, Vol. 1, Iss. 5, 2003-10 ,pp. : 367-385

Elsevier

Access to resources Recommend Favorite