Matching (graph theory) | Wikipedia audio article
Channel: wikipedia tts
Date: 2018-12-28

This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/Matching_(graph_theory)


00:00:18 1 Definition
00:04:02 2 Properties
00:06:18 3 Matching polynomials
00:07:53 4 Algorithms and computational complexity
00:08:05 4.1 In unweighted bipartite graphs
00:13:41 4.2 In weighted bipartite graphs
00:15:24 4.3 In general graphs
00:16:49 4.4 Maximal matchings
00:18:15 4.5 Counting problems
00:19:43 4.6 Finding all maximally-matchable edges
00:22:19 5 Characterizations and notes
00:23:18 6 Applications
00:23:28 6.1 Matching in general graphs
00:24:17 6.2 Matching in bipartite graphs
00:24:49 7 See also



Listening is a more natural way of learning, when compared to reading. Written language only began at around 3200 BC, but spoken language has existed long ago.

Learning by listening is a great way to:
- increases imagination and understanding
- improves your listening skills
- improves your own spoken accent
- learn while on the move
- reduce eye strain

Now learn the vast amount of general knowledge available on Wikipedia through audio (audio article). You could even learn subconsciously by playing the audio while you are sleeping! If you are planning to listen a lot, you could try using a bone conduction headphone, or a standard speaker instead of an earphone.

Listen on Google Assistant through Extra Audio:
https://assistant.google.com/services/invoke/uid/0000001a130b3f91
Other Wikipedia audio articles at:
https://www.youtube.com/results?search_query=wikipedia+tts
Upload your own Wikipedia articles through:
https://github.com/nodef/wikipedia-tts
Speaking Rate: 0.7146660592068572
Voice name: en-AU-Wavenet-C


"I cannot teach anybody anything, I can only make them think."
- Socrates


SUMMARY
=======
In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. Finding a matching in a bipartite graph can be treated as a network flow problem.