Classical bipartite cardinality matching
From Algowiki
Revision as of 13:41, 17 November 2014 by
Weihe
(
talk
|
contribs
)
(Created page with "== Abstract view == '''Algorithmic problem:'''
Cardinality-maximal matching
in Basic graph definitions#Bipartitions and...")
(diff) ← Older revision |
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to navigation
Jump to search
Abstract view
Algorithmic problem:
Cardinality-maximal matching
in
bipartite graphs
.
Type of algorithm:
loop.
Navigation menu
Personal tools
Log in
associated-pages
Page
Discussion
English
Views
Read
View source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Tools
What links here
Related changes
Printable version
Permanent link
Page information