Sciweavers

    376 search results - page 24 / 76
    » Near-optimum Universal Graphs for Graphs with Bounded Degree...
    Sort
    View
    INFOCOM
    2011
    IEEE
    205views Communications» more  INFOCOM 2011»
    Approximate distance queries and compact routing in sparse graphs
    13 years 4 days ago
    Approximate distance queries and compact routing in sparse graphs
    Download  www.cs.illinois.edu
    —An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
    Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
    claim paper
    Read More »
    ENDM
    2006
    119views more  ENDM 2006»
    The incidence game chromatic number
    13 years 8 months ago
    The incidence game chromatic number
    Download  www.fernuni-hagen.de
    We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
    Stephan Dominique Andres
    claim paper
    Read More »
    DAM
    2008
    108views more  DAM 2008»
    On the complexity of the multicut problem in bounded tree-width graphs and digraphs
    13 years 8 months ago
    On the complexity of the multicut problem in bounded tree-width graphs and digraphs
    Download  www.lri.fr
    Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
    Cédric Bentz
    claim paper
    Read More »
    SAC
    2000
    ACM
    170views Applied Computing» more  SAC 2000»
    A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
    14 years 1 months ago
    A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
    Download  www.ads.tuwien.ac.at
    The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
    Günther R. Raidl, Bryant A. Julstrom
    claim paper
    Read More »
    DM
    2008
    114views more  DM 2008»
    Subdivisions of graphs: A generalization of paths and cycles
    13 years 8 months ago
    Subdivisions of graphs: A generalization of paths and cycles
    Download  www.mathcs.emory.edu
    One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
    Ch. Sobhan Babu, Ajit A. Diwan
    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.