Sciweavers

    882 search results - page 107 / 177
    » On the Hardness of Graph Isomorphism
    Sort
    View
    CP
    2006
    Springer
    138views Artificial Intelligence» more  CP 2006»
    Reasoning by Dominance in Not-Equals Binary Constraint Networks
    14 years 14 days ago
    Reasoning by Dominance in Not-Equals Binary Constraint Networks
    Download  personal.cis.strath.ac.uk
    Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
    Belaid Benhamou, Mohamed Réda Saïdi
    claim paper
    Read More »
    BMCBI
    2006
    141views more  BMCBI 2006»
    Maximum common subgraph: some upper bound and lower bound results
    13 years 8 months ago
    Maximum common subgraph: some upper bound and lower bound results
    Download  www.biomedcentral.com
    Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
    Xiuzhen Huang, Jing Lai, Steven F. Jennings
    claim paper
    Read More »
    MST
    2006
    99views more  MST 2006»
    Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
    13 years 8 months ago
    Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
    Download  ccc.cs.uni-duesseldorf.de
    We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
    Tobias Riege, Jörg Rothe
    claim paper
    Read More »
    ISAAC
    2010
    Springer
    226views Algorithms» more  ISAAC 2010»
    On Tractable Cases of Target Set Selection
    13 years 6 months ago
    On Tractable Cases of Target Set Selection
    Download  theinf1.informatik.uni-jena.de
    We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
    André Nichterlein, Rolf Niedermeier, Johann...
    claim paper
    Read More »
    KDD
    2008
    ACM
    193views Data Mining» more  KDD 2008»
    A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
    14 years 9 months ago
    A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
    Download  www.isys.ucl.ac.be
    This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
    Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
    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.