Sciweavers

    1963 search results - page 73 / 393
    » The Maximum Solution Problem on Graphs
    Sort
    View
    INFOCOM
    2008
    IEEE
    162views Communications» more  INFOCOM 2008»
    Distributed Operator Placement and Data Caching in Large-Scale Sensor Networks
    14 years 3 months ago
    Distributed Operator Placement and Data Caching in Large-Scale Sensor Networks
    Download  www.cs.virginia.edu
    Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
    Lei Ying, Zhen Liu, Donald F. Towsley, Cathy H. Xi...
    claim paper
    Read More »
    JDA
    2006
    83views more  JDA 2006»
    Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
    13 years 8 months ago
    Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
    Download  www.nishizeki.ecei.tohoku.ac.jp
    Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
    Takehiro Ito, Xiao Zhou, Takao Nishizeki
    claim paper
    Read More »
    ISLPED
    2003
    ACM
    96views Hardware» more  ISLPED 2003»
    Effective graph theoretic techniques for the generalized low power binding problem
    14 years 2 months ago
    Effective graph theoretic techniques for the generalized low power binding problem
    Download  www.cecs.uci.edu
    This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
    Azadeh Davoodi, Ankur Srivastava
    claim paper
    Read More »
    ENDM
    2010
    127views more  ENDM 2010»
    MPQ-trees for orthogonal packing problem
    13 years 8 months ago
    MPQ-trees for orthogonal packing problem
    Download  www.labri.fr
    Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
    Cédric Joncour, Arnaud Pêcher, Petru ...
    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
    14 years 2 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
    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.