Sciweavers

    1215 search results - page 122 / 243
    » Combinatorics
    Sort
    View
    CPM
    2007
    Springer
    124views Combinatorics» more  CPM 2007»
    Cache-Oblivious Index for Approximate String Matching
    16 years 16 days ago
    Cache-Oblivious Index for Approximate String Matching
    Download  www.csd.uwo.ca
    Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Ta...
    claim paper
    Read More »
    CPM
    2005
    Springer
    75views Combinatorics» more  CPM 2005»
    Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern
    15 years 12 months ago
    Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern
    Download  www.cs.ucr.edu
    Brona Brejová, Daniel G. Brown, Ian M. Harr...
    claim paper
    Read More »
    CPM
    2010
    Springer
    116views Combinatorics» more  CPM 2010»
    Extended Islands of Tractability for Parsimony Haplotyping
    15 years 11 months ago
    Extended Islands of Tractability for Parsimony Haplotyping
    Download  theinf1.informatik.uni-jena.de
    Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Joh...
    claim paper
    Read More »
    COMBINATORICS
    2007
    77views more  COMBINATORICS 2007»
    Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs
    15 years 6 months ago
    Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs
    Download  www.emis.de
    We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
    Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
    claim paper
    Read More »
    COMBINATORICS
    2004
    93views more  COMBINATORICS 2004»
    Degree Powers in Graphs with Forbidden Subgraphs
    15 years 6 months ago
    Degree Powers in Graphs with Forbidden Subgraphs
    Download  www.combinatorics.org
    For every real p > 0 and simple graph G, set f (p, G) = uV (G) dp (u) , and let (r, p, n) be the maximum of f (p, G) taken over all Kr+1-free graphs G of order n. We prove tha...
    Béla Bollobás, Vladimir Nikiforov
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.