Sciweavers

    124 search results - page 2 / 25
    » The Path Length of Binary Trees
    Sort
    View
    EJC
    2008
    79views Information Technology» more  EJC 2008»
    On Postnikov's hook length formula for binary trees
    13 years 5 months ago
    On Postnikov's hook length formula for binary trees
    Download  www.math.ualberta.ca
    We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
    William Y. C. Chen, Laura L. M. Yang
    claim paper
    Read More »
    CPC
    2002
    80views more  CPC 2002»
    The Wiener Index Of Random Trees
    13 years 5 months ago
    The Wiener Index Of Random Trees
    Download  www.math.uni-frankfurt.de
    The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
    Ralph Neininger
    claim paper
    Read More »
    COMBINATORICA
    2010
    130views Machine Learning» more  COMBINATORICA 2010»
    New hook length formulas for binary trees
    13 years 2 months ago
    New hook length formulas for binary trees
    Download  www-irma.u-strasbg.fr
    Guo-Niu Han
    claim paper
    Read More »
    ALGORITHMICA
    2010
    95views more  ALGORITHMICA 2010»
    Homogeneous String Segmentation using Trees and Weighted Independent Sets
    13 years 5 months ago
    Homogeneous String Segmentation using Trees and Weighted Independent Sets
    Download  www.cse.chalmers.se
    We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
    Peter Damaschke
    claim paper
    Read More »
    DAM
    2000
    199views more  DAM 2000»
    Approximation algorithms for the shortest total path length spanning tree problem
    13 years 5 months ago
    Approximation algorithms for the shortest total path length spanning tree problem
    Download  www.csie.ntu.edu.tw
    Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
    Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.