Sciweavers

    DAM
    2016
    61views more  DAM 2016»
    The challenges of unbounded treewidth in parameterised subgraph counting problems
    8 years 9 months ago
    The challenges of unbounded treewidth in parameterised subgraph counting problems
    Download  www.maths.qmul.ac.uk
    Many of the existing tractability results for parameterised problems which involve finding or counting subgraphs with particular properties rely on bounding the treewidth of the ...
    Kitty Meeks
    claim paper
    Read More »
    DAM
    2016
    70views more  DAM 2016»
    Strengthened bounds for the probability of k-out-of-n events
    8 years 9 months ago
    Strengthened bounds for the probability of k-out-of-n events
    Download  www2.isye.gatech.edu
    Given a set of n random events in a probability space, represented by n Bernoulli variables, we consider the probability that k out of n events occur. When partial distribution in...
    Feng Qiu, Shabbir Ahmed, Santanu S. Dey
    claim paper
    Read More »
    DAM
    2016
    114views more  DAM 2016»
    An exact algorithm for maximum independent set in degree-5 graphs
    8 years 9 months ago
    An exact algorithm for maximum independent set in degree-5 graphs
    Download  www.amp.i.kyoto-u.ac.jp
    The maximum independent set problem is a basic NP-hard problem and has been extensively studied in exact algorithms. The maximum independent set problems in low-degree graphs are ...
    Mingyu Xiao, Hiroshi Nagamochi
    claim paper
    Read More »
    DAM
    2016
    48views more  DAM 2016»
    Convex hulls of superincreasing knapsacks and lexicographic orderings
    8 years 9 months ago
    Convex hulls of superincreasing knapsacks and lexicographic orderings
    Download  www.optimization-online.org
    We consider bounded integer knapsacks where the weights and variable upper bounds together form a superincreasing sequence. The elements of this superincreasing knapsack are exactl...
    Akshay Gupte
    claim paper
    Read More »
    DAM
    2016
    74views more  DAM 2016»
    Network decontamination under m-immunity
    8 years 9 months ago
    Network decontamination under m-immunity
    Download  people.scs.carleton.ca
    We consider the problem of decontaminating an infected network using as few mobile cleaning agents as possible and avoiding recontamination. After a cleaning agent has left a vert...
    Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nic...
    claim paper
    Read More »
    DAM
    2016
    43views more  DAM 2016»
    The channel capacity of read/write isolated memory
    8 years 9 months ago
    The channel capacity of read/write isolated memory
    Download  www.cse.ust.hk
    In this paper, we reÿne upper and lower bounds for the channel capacity of a serial, binary rewritable medium in which no consecutive locations may store 1’s and no consecutive...
    Chuan-Long Wang, Xuerong Yong, Mordecai J. Golin
    claim paper
    Read More »
    DAM
    2016
    72views more  DAM 2016»
    An upper bound on the extremal version of Hajnal's triangle-free game
    8 years 9 months ago
    An upper bound on the extremal version of Hajnal's triangle-free game
    Download  cache.oalib.com
    A game starts with the empty graph on n vertices, and two player alternate adding edges to the graph. Only moves which do not create a triangle are valid. The game ends when a maxi...
    Csaba Biró, Paul Horn, D. Jacob Wildstrom
    claim paper
    Read More »
    DAM
    2016
    49views more  DAM 2016»
    Bichain graphs: Geometric model and universal graphs
    8 years 9 months ago
    Bichain graphs: Geometric model and universal graphs
    Download  www.cs.toronto.edu
    Bichain graphs form a bipartite analog of split permutation graphs, also known as split graphs of Dilworth number 2. Unlike graphs of Dilworth number 1 that enjoy many nice proper...
    Robert Brignall, Vadim V. Lozin, Juraj Stacho
    claim paper
    Read More »
    DAM
    2016
    70views more  DAM 2016»
    Scheduling co-operating stacking cranes with predetermined container sequences
    8 years 9 months ago
    Scheduling co-operating stacking cranes with predetermined container sequences
    Download  www.optimization-online.org
    Crane scheduling in container terminals is known as a difficult optimization problem that has become even more challenging in recent years with the proliferation of multi-gantry a...
    Dirk Briskorn, Panagiotis Angeloudis
    claim paper
    Read More »
    DAM
    2016
    74views more  DAM 2016»
    Enumerating minimal dominating sets in chordal bipartite graphs
    8 years 9 months ago
    Enumerating minimal dominating sets in chordal bipartite graphs
    Download  www.ii.uib.no
    We show that all minimal dominating sets of a chordal bipartite graph can be generated in incremental polynomial, hence output polynomial, time. Enumeration of minimal dominating ...
    Petr A. Golovach, Pinar Heggernes, Mamadou Moustap...
    claim paper
    Read More »
    12next ›last »
    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.