Constructing an algorithm of quadratic time complexity for finding the maximal matching
By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory, this paper shows that the task on establishing a maximal matching in an arbitrary graph can be reduced to its bipartite case. It has been proven that each current matching in an arbitrary graph is mu...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
PC Technology Center
2019-12-01
|
| Series: | Eastern-European Journal of Enterprise Technologies |
| Subjects: | |
| Online Access: | http://journals.uran.ua/eejet/article/view/188104 |