Sciweavers

    554 search results - page 24 / 111
    » Optimizing in Graphs with Expensive Computation of Edge Weig...
    Sort
    View
    SDM
    2012
    SIAM
    304views Data Mining» more  SDM 2012»
    Fast Random Walk Graph Kernel
    11 years 11 months ago
    Fast Random Walk Graph Kernel
    Download  www.cs.cmu.edu
    Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
    U. Kang, Hanghang Tong, Jimeng Sun
    claim paper
    Read More »
    OL
    2011
    242views Neural Networks» more  OL 2011»
    On connected domination in unit ball graphs
    13 years 3 months ago
    On connected domination in unit ball graphs
    Download  ise.tamu.edu
    Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
    Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
    claim paper
    Read More »
    IPPS
    1998
    IEEE
    140views Distributed And Parallel Com...» more  IPPS 1998»
    NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
    14 years 1 months ago
    NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
    Download  ipdps.cc.gatech.edu
    For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
    Sven Venema, Hong Shen, Francis Suraweera
    claim paper
    Read More »
    WICON
    2008
    150views Computer Networks» more  WICON 2008»
    On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
    13 years 10 months ago
    On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
    Download  udelmodels.eecis.udel.edu
    It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
    Peng Wang, Stephan Bohacek
    claim paper
    Read More »
    SIROCCO
    2007
    143views Information Technology» more  SIROCCO 2007»
    Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
    13 years 10 months ago
    Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
    Download  www.matem.unam.mx
    The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
    Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis...
    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.