Sciweavers

    760 search results - page 47 / 152
    » Algorithms for finding clique-transversals of graphs
    Sort
    View
    SODA
    2004
    ACM
    160views Algorithms» more  SODA 2004»
    On colorings of squares of outerplanar graphs
    13 years 10 months ago
    On colorings of squares of outerplanar graphs
    Download  math.gmu.edu
    We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
    Geir Agnarsson, Magnús M. Halldórsso...
    claim paper
    Read More »
    SODA
    2004
    ACM
    152views Algorithms» more  SODA 2004»
    Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
    13 years 10 months ago
    Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
    Download  ems.calumet.purdue.edu
    Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
    Artur Czumaj, Michelangelo Grigni, Papa Sissokho, ...
    claim paper
    Read More »
    ECEASST
    2006
    305views more  ECEASST 2006»
    The ParMol Package for Frequent Subgraph Mining
    13 years 8 months ago
    The ParMol Package for Frequent Subgraph Mining
    Download  kops.ub.uni-konstanz.de
    Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
    Thorsten Meinl, Marc Wörlein, Olga Urzova, In...
    claim paper
    Read More »
    SIAMJO
    2008
    175views more  SIAMJO 2008»
    On Bin Packing with Conflicts
    13 years 8 months ago
    On Bin Packing with Conflicts
    Download  math.haifa.ac.il
    Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
    Leah Epstein, Asaf Levin
    claim paper
    Read More »
    SIAMSC
    2008
    182views more  SIAMSC 2008»
    A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
    13 years 8 months ago
    A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
    Download  www.math.nus.edu.sg
    We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
    Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
    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.