Sciweavers

    DM
    2008
    129views more  DM 2008»
    On 3-regular 4-ordered graphs
    13 years 11 months ago
    On 3-regular 4-ordered graphs
    Download  www-math.mit.edu
    A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian...
    Karola Mészáros
    claim paper
    Read More »
    SARA
    2009
    Springer
    231views Artificial Intelligence» more  SARA 2009»
    Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles
    14 years 5 months ago
    Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles
    Download  webdocs.cs.ualberta.ca
    We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
    Miroslav N. Velev, Ping Gao 0002
    claim paper
    Read More »
    « first‹ previous12
    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.