Solved

Maximum cardinality search algorithm working

Posted on 2007-03-18
4
738 Views
Last Modified: 2013-11-15
What is or how does Maximum cardinality search algorithm works
Any tutorials would be helpful
0
Comment
Question by:ssami81
4 Comments
 
LVL 22

Accepted Solution

by:
cookre earned 250 total points
ID: 18746077
"A matching in an undirected graph is a set of edges such that no two meet in a common vertex. A maximum cardinality matching has the maximum number of
edges over all matchings in the graph."

See thread beginning: http://aspn.activestate.com/ASPN/Mail/Message/boost/2805153
0
 
LVL 84

Assisted Solution

by:ozo
ozo earned 250 total points
ID: 18746439
0

Featured Post

Netscaler Common Configuration How To guides

If you use NetScaler you will want to see these guides. The NetScaler How To Guides show administrators how to get NetScaler up and configured by providing instructions for common scenarios and some not so common ones.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

A short article about problems I had with the new location API and permissions in Marshmallow
Creating and Managing Databases with phpMyAdmin in cPanel.
An introduction to basic programming syntax in Java by creating a simple program. Viewers can follow the tutorial as they create their first class in Java. Definitions and explanations about each element are given to help prepare viewers for future …
Viewers will learn how to properly install Eclipse with the necessary JDK, and will take a look at an introductory Java program. Download Eclipse installation zip file: Extract files from zip file: Download and install JDK 8: Open Eclipse and …

810 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question