Sciweavers

    524 search results - page 9 / 105
    » On the Maximum Number of Cliques in a Graph
    Sort
    View
    MST
    2010
    107views more  MST 2010»
    Fixed-Parameter Algorithms for Cluster Vertex Deletion
    13 years 6 months ago
    Fixed-Parameter Algorithms for Cluster Vertex Deletion
    Download  theinf1.informatik.uni-jena.de
    We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
    Falk Hüffner, Christian Komusiewicz, Hannes M...
    claim paper
    Read More »
    CPC
    2007
    105views more  CPC 2007»
    Packing Cliques in Graphs with Independence Number 2
    13 years 7 months ago
    Packing Cliques in Graphs with Independence Number 2
    Download  research.haifa.ac.il
    Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
    Raphael Yuster
    claim paper
    Read More »
    ISDA
    2009
    IEEE
    115views Operating System» more  ISDA 2009»
    Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
    14 years 2 months ago
    Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
    Download  www.mathematik.uni-marburg.de
    —Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
    Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...
    claim paper
    Read More »
    DISOPT
    2008
    55views more  DISOPT 2008»
    A sequential elimination algorithm for computing bounds on the clique number of a graph
    13 years 7 months ago
    A sequential elimination algorithm for computing bounds on the clique number of a graph
    Download  www.gerad.ca
    Bernard Gendron, Alain Hertz, Patrick St-Louis
    claim paper
    Read More »
    24
    Voted
    SODA
    2004
    ACM
    160views Algorithms» more  SODA 2004»
    On colorings of squares of outerplanar graphs
    13 years 9 months ago
    On colorings of squares of outerplanar graphs
    Download  math.gmu.edu
    We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
    Geir Agnarsson, Magnús M. Halldórsso...
    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.