Sciweavers

    3204 search results - page 177 / 641
    » The b-chromatic Number of a Graph
    Sort
    View
    FOCS
    2004
    IEEE
    175views Theoretical Computer Science» more  FOCS 2004»
    Edge-Disjoint Paths in Planar Graphs
    14 years 2 months ago
    Edge-Disjoint Paths in Planar Graphs
    Download  www.cs.uiuc.edu
    We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
    Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
    claim paper
    Read More »
    WSC
    2007
    110views Modeling And Simulation» more  WSC 2007»
    Alternative thread scoring methods in qualitative event graphs
    14 years 20 days ago
    Alternative thread scoring methods in qualitative event graphs
    Download  www.informs-sim.org
    Event Graphs (EGs) and Simulation Graph Models provide a powerful and general modeling framework for discrete event simulation. Qualitative Event Graphs (QEGs) extend the EG frame...
    Ricki G. Ingalls, Douglas J. Morrice
    claim paper
    Read More »
    SODA
    2007
    ACM
    131views Algorithms» more  SODA 2007»
    On the K-simple shortest paths problem in weighted directed graphs
    13 years 11 months ago
    On the K-simple shortest paths problem in weighted directed graphs
    Download  www.wisdom.weizmann.ac.il
    We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
    Liam Roditty
    claim paper
    Read More »
    IJCAI
    2003
    100views Artificial Intelligence» more  IJCAI 2003»
    On a generalization of triangulated graphs for domains decomposition of CSPs
    13 years 11 months ago
    On a generalization of triangulated graphs for domains decomposition of CSPs
    Download  dli.iiit.ac.in
    In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
    Assef Chmeiss, Philippe Jégou, Lamia Keddar
    claim paper
    Read More »
    JDA
    2008
    94views more  JDA 2008»
    Approximability of partitioning graphs with supply and demand
    13 years 10 months ago
    Approximability of partitioning graphs with supply and demand
    Download  erikdemaine.org
    Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
    Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
    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.