Search Results - CodeGuru Forums
CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com

Search:

Type: Posts; User: NinjaJohn

Search: Search took 0.01 seconds.

  1. Replies
    4
    Views
    1,596

    Re: P=NP? (polynomial graph coloring)

    correction: color sprawl - a set of colored nodes that are directly or indirectly connected via other colored nodes.
  2. Replies
    4
    Views
    1,596

    Re: P=NP? (polynomial graph coloring)

    Thanks for the response laserlight! .. From what I have seen, It appears that minimum colors are not guaranteed when we have multiple "starting nodes", forcing additional color constraints. My...
  3. Replies
    4
    Views
    1,596

    Re: P=NP? (polynomial graph coloring)

    correction:

    … In code we could keep track of the color sequence in a bit map .. traversing this bit map for every node to select the lowest color in the sequence would add at most n * t to the...
  4. Replies
    4
    Views
    1,596

    P=NP? (polynomial graph coloring)

    I came up with a polynomial bounded algorithm (exponential to be specific) for graph coloring a year or two ago. Does anyone agree/disagree with my findings? Here is my doc:

    Johnathon Pandich
    ...
Results 1 to 4 of 4


Windows Mobile Development Center


Click Here to Expand Forum to Full Width

This is a CodeGuru survey question.


Featured


HTML5 Development Center