Sciweavers

    24 search results - page 4 / 5
    » colognetwente 2007
    Sort
    View
    COLOGNETWENTE
    2009
    125views Optimization» more  COLOGNETWENTE 2009»
    The Anonymous Subgraph Problem
    13 years 6 months ago
    The Anonymous Subgraph Problem
    Download  www.eis.mdx.ac.uk
    Andrea Bettinelli, Leo Liberti, Franco Raimondi, D...
    claim paper
    Read More »
    COLOGNETWENTE
    2009
    107views Optimization» more  COLOGNETWENTE 2009»
    Integer Programming with 2-Variable Equations and 1-Variable Inequalities
    13 years 6 months ago
    Integer Programming with 2-Variable Equations and 1-Variable Inequalities
    Download  www.ida.liu.se
    We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objectiv...
    Manuel Bodirsky, Gustav Nordh, Timo von Oertzen
    claim paper
    Read More »
    COLOGNETWENTE
    2009
    97views Optimization» more  COLOGNETWENTE 2009»
    On Self-Duality of Branchwidth in Graphs of Bounded Genus
    13 years 6 months ago
    On Self-Duality of Branchwidth in Graphs of Bounded Genus
    Download  www.cs.technion.ac.il
    A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph more than a constant factor. Self-duality has been...
    Ignasi Sau, Dimitrios M. Thilikos
    claim paper
    Read More »
    COLOGNETWENTE
    2009
    165views Optimization» more  COLOGNETWENTE 2009»
    Colored Trees in Edge-Colored Graphs
    13 years 6 months ago
    Colored Trees in Edge-Colored Graphs
    Download  www.lri.fr
    We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
    A. Abouelaoualim, V. Borozan, Yannis Manoussakis, ...
    claim paper
    Read More »
    COLOGNETWENTE
    2009
    123views Optimization» more  COLOGNETWENTE 2009»
    A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
    13 years 6 months ago
    A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
    Download  www.cs.uoi.gr
    : Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
    Stavros D. Nikolopoulos, Charis Papadopoulos
    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.