Sciweavers

    524 search results - page 78 / 105
    » On the Maximum Number of Cliques in a Graph
    Sort
    View
    APPML
    2007
    101views more  APPML 2007»
    Extension of a theorem of Whitney
    13 years 7 months ago
    Extension of a theorem of Whitney
    Download  www9.georgetown.edu
    It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
    Paul C. Kainen, Shannon Overbay
    claim paper
    Read More »
    COMBINATORICA
    2008
    84views more  COMBINATORICA 2008»
    Parity check matrices and product representations of squares
    13 years 7 months ago
    Parity check matrices and product representations of squares
    Download  www.cims.nyu.edu
    Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
    Assaf Naor, Jacques Verstraëte
    claim paper
    Read More »
    IPL
    2006
    97views more  IPL 2006»
    A fixed-parameter tractability result for multicommodity demand flow in trees
    13 years 7 months ago
    A fixed-parameter tractability result for multicommodity demand flow in trees
    Download  theinf1.informatik.uni-jena.de
    We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
    Jiong Guo, Rolf Niedermeier
    claim paper
    Read More »
    MOBICOM
    2006
    ACM
    163views Communications» more  MOBICOM 2006»
    On the complexity of scheduling in wireless networks
    14 years 1 months ago
    On the complexity of scheduling in wireless networks
    Download  www.eecis.udel.edu
    We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
    Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
    claim paper
    Read More »
    STOC
    2009
    ACM
    123views Algorithms» more  STOC 2009»
    An improved constant-time approximation algorithm for maximum~matchings
    14 years 8 months ago
    An improved constant-time approximation algorithm for maximum~matchings
    Download  www.lab2.kuis.kyoto-u.ac.jp
    This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
    Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
    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.