Notices
Results 1 to 1 of 1

Thread: The variants of k-node subgraph

  1. #1 The variants of k-node subgraph 
    New Member
    Join Date
    Jan 2012
    Posts
    1
    Hello guys,

    I'm wondering whether there exist algorithms
    to solve the problem of selecting k nodes in a weighted
    graph G(V,E)
    such that the weighting sum of the nodes
    and vertices
    is maximized. Please help me if you have any clues.
    Thank you very much.

    P.S. NODE AND EDGE are both with positive weights, w(v) and
    w(e). The subgraph can be connected (or not)

    Best regards,
    Austin


    Reply With Quote  
     

  2.  
     

Similar Threads

  1. Variants of SAD
    By Nevyn in forum Health & Medicine
    Replies: 10
    Last Post: February 18th, 2014, 09:34 AM
  2. The timeline spiral (Possible variants, grandfather paradox)
    By a-x-med in forum Personal Theories & Alternative Ideas
    Replies: 0
    Last Post: September 28th, 2009, 09:48 AM
  3. Nucleotide variants and Obesity
    By gottspieler in forum Biology
    Replies: 2
    Last Post: March 1st, 2009, 02:44 AM
Tags for this Thread

View Tag Cloud

Bookmarks
Bookmarks
Posting Permissions
  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •