Sciweavers

    656 search results - page 18 / 132
    » Marrying Words and Trees
    Sort
    View
    103
    Voted
    JUCS
    2007
    148views more  JUCS 2007»
    Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
    14 years 9 months ago
    Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
    Download  www.jucs.org
    : We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
    Adrian Dumitrescu, Csaba D. Tóth
    claim paper
    Read More »
    JCSS
    2007
    107views more  JCSS 2007»
    On the minimization of XML Schemas and tree automata for unranked trees
    14 years 9 months ago
    On the minimization of XML Schemas and tree automata for unranked trees
    Download  lrb.cs.uni-dortmund.de
    Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
    Wim Martens, Joachim Niehren
    claim paper
    Read More »
    ICALP
    2007
    Springer
    103views Programming Languages» more  ICALP 2007»
    Succinct Ordinal Trees Based on Tree Covering
    15 years 3 months ago
    Succinct Ordinal Trees Based on Tree Covering
    Download  www.cs.uwaterloo.ca
    Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
    Meng He, J. Ian Munro, S. Srinivasa Rao
    claim paper
    Read More »
    IPL
    2007
    89views more  IPL 2007»
    On the longest path algorithm for reconstructing trees from distance matrices
    14 years 9 months ago
    On the longest path algorithm for reconstructing trees from distance matrices
    Download  www.cs.yale.edu
    Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...
    Lev Reyzin, Nikhil Srivastava
    claim paper
    Read More »
    58
    Voted
    ALGORITHMICA
    2002
    109views more  ALGORITHMICA 2002»
    A Near-Linear Area Bound for Drawing Binary Trees
    14 years 9 months ago
    A Near-Linear Area Bound for Drawing Binary Trees
    Download  grid.tsinghua.edu.cn
    We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...
    Timothy M. Chan
    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-2025, USA.