Search: none
Add a search phrase to search resource page titles and descriptions. Different keywords are ANDed with tags.
 

MSDN Archive

Target and filter your gallery search using the following dynamic dialogues.
1-3 of 3Resources < Previous 1 Next >
Resource Page Name and Description Current Release
In computer science, the maximum clique problem is challenging and not completely understood. But the code used to solve it can help developers out in important areas such as social networking. So ...
In computer science, the maximum clique problem is challenging and not completely understood. But the code used to solve it can help developers out in important areas such as social networking. So dig in.
Popular tags: .NET, 2011, MSDN Magazine, Oct 2011 Issue, October Issue, Test Run, Testing
Downloads: 0 | Started: Sep 27 2011  | Contributors: 2
mag201110TestRun
Sep 19 2011
Dr. McCaffrey wraps up his examination of the challenging and mysterious maximum clique problem—often used in social networking scenarios—with an advanced solution called the tabu algorithm.
Dr. McCaffrey wraps up his examination of the challenging and mysterious maximum clique problem—often used in social networking scenarios—with an advanced solution called the tabu algorithm.
Popular tags: Dec 2011, December issue, Testing, MSDN Magazine, 2011
Downloads: 0 | Started: Nov 30 2011  | Contributors: 1
Dr. McCaffrey this month presents a greedy algorithm as a solution to the graph maximum clique problem, which is to find the largest group of nodes in a graph that are all connected to one another....
Dr. McCaffrey this month presents a greedy algorithm as a solution to the graph maximum clique problem, which is to find the largest group of nodes in a graph that are all connected to one another. He explains how to design and test these algorithms to solve the problem.
Popular tags: 2011, MSDN Magazine, Nov 2011, November Issue, Testing
Downloads: 0 | Started: Jan 17 2012  | Contributors: 1
Code Sample
Jan 17 2012
Updating...
Page view tracker