Sciweavers

    3019 search results - page 9 / 604
    » Approximating the Domatic Number
    Sort
    View
    FOCS
    1998
    IEEE
    72views Theoretical Computer Science» more  FOCS 1998»
    Approximating a Finite Metric by a Small Number of Tree Metrics
    15 years 7 months ago
    Approximating a Finite Metric by a Small Number of Tree Metrics
    Download  www.cis.upenn.edu
    Moses Charikar, Chandra Chekuri, Ashish Goel, Sudi...
    claim paper
    Read More »
    121
    Voted
    CPM
    1997
    Springer
    111views Combinatorics» more  CPM 1997»
    Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem
    15 years 7 months ago
    Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem
    Download  www.csc.liv.ac.uk
    Mary Cryan, Leslie Ann Goldberg, Cynthia A. Philli...
    claim paper
    Read More »
    CPC
    2004
    68views more  CPC 2004»
    Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
    15 years 3 months ago
    Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
    Download  www.dur.ac.uk
    Magnus Bordewich
    claim paper
    Read More »
    COMPUTING
    2000
    89views more  COMPUTING 2000»
    Condition Numbers of Approximate Schur Complements in Two- and Three-Dimensional Discretizations on Hierarchically Ordered Grids
    15 years 3 months ago
    Condition Numbers of Approximate Schur Complements in Two- and Three-Dimensional Discretizations on Hierarchically Ordered Grids
    Download  www.springerlink.com
    We investigate multilevel incomplete factorizations of M-matrices arising from
    J. K. Kraus, C. W. Brand
    claim paper
    Read More »
    ISAAC
    2007
    Springer
    183views Algorithms» more  ISAAC 2007»
    The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
    15 years 9 months ago
    The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
    Download  www.imsc.res.in
    The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
    Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
    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.