Sciweavers

    4074 search results - page 203 / 815
    » Abstract Graph Transformation
    Sort
    View
    ESA
    2009
    Springer
    131views Algorithms» more  ESA 2009»
    Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
    16 years 1 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 »
    MLG
    2007
    Springer
    186views Machine Learning» more  MLG 2007»
    Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic
    16 years 18 days ago
    Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic
    Download  mlg07.dsi.unifi.it
    d Abstract) Kaspar Riesen, Stefan Fankhauser and Horst Bunke2
    Kaspar Riesen, Stefan Fankhauser, Horst Bunke
    claim paper
    Read More »
    DCG
    2010
    101views more  DCG 2010»
    Obstacle Numbers of Graphs
    15 years 6 months ago
    Obstacle Numbers of Graphs
    Download  www.willamette.edu
    es of Statistics (2); Calculus 2; Multivariable Calculus; Abstract Algebra 1 (2) Research with undergraduate students:
    Hannah Alpert, Christina Koch, Joshua D. Laison
    claim paper
    Read More »
    ENDM
    2008
    57views more  ENDM 2008»
    Six-Critical Graphs on the Klein Bottle
    15 years 6 months ago
    Six-Critical Graphs on the Klein Bottle
    Download  www.carlyerger.com
    Abstract Nathan Chenette Ken-ichi Kawarabayashi Daniel Kr
    Nathan Chenette, Luke Postle, Noah Streib, Robin T...
    claim paper
    Read More »
    DMTCS
    2011
    261views Mathematics» more  DMTCS 2011»
    An expected polynomial time algorithm for coloring 2-colorable 3-graphs
    14 years 6 months ago
    An expected polynomial time algorithm for coloring 2-colorable 3-graphs
    Download  www.math.uni-hamburg.de
    Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
    Yury Person, Mathias Schacht
    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.