Sciweavers

    2 search results - page 1 / 1
    » Tree-edges deletion problems with bounded diameter obstructi...
    Sort
    View
    DAM
    2007
    70views more  DAM 2007»
    Tree-edges deletion problems with bounded diameter obstruction sets
    13 years 4 months ago
    Tree-edges deletion problems with bounded diameter obstruction sets
    Download  cs.haifa.ac.il
    We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
    Dekel Tsur
    claim paper
    Read More »
    ISAAC
    2010
    Springer
    226views Algorithms» more  ISAAC 2010»
    On Tractable Cases of Target Set Selection
    13 years 2 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 »
    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.