Sciweavers

    9532 search results - page 196 / 1907
    » Logic, Graphs, and Algorithms
    Sort
    View
    ESA
    2004
    Springer
    92views Algorithms» more  ESA 2004»
    Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
    15 years 10 months ago
    Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
    Download  rutcor.rutgers.edu
    Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
    claim paper
    Read More »
    WAOA
    2004
    Springer
    99views Algorithms» more  WAOA 2004»
    Priority Algorithms for Graph Optimization Problems
    15 years 10 months ago
    Priority Algorithms for Graph Optimization Problems
    Download  dcg.ethz.ch
    Allan Borodin, Joan Boyar, Kim S. Larsen
    claim paper
    Read More »
    ESA
    2003
    Springer
    107views Algorithms» more  ESA 2003»
    Automated Generation of Search Tree Algorithms for Graph Modification Problems
    15 years 9 months ago
    Automated Generation of Search Tree Algorithms for Graph Modification Problems
    Download  theinf1.informatik.uni-jena.de
    Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
    claim paper
    Read More »
    122
    Voted
    ISCAS
    1994
    IEEE
    93views Hardware» more  ISCAS 1994»
    The Dynamic Locking Heuristic - A New Graph Partitioning Algorithm
    15 years 8 months ago
    The Dynamic Locking Heuristic - A New Graph Partitioning Algorithm
    Download  reference.kfupm.edu.sa
    In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
    Achim G. Hoffmann
    claim paper
    Read More »
    ESA
    2009
    Springer
    131views Algorithms» more  ESA 2009»
    Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
    15 years 11 months ago
    Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
    Download  www.imsc.res.in
    Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
    Geevarghese Philip, Venkatesh Raman, Somnath Sikda...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.