マッチング (グラフ理論)
1. Matching (graph theory)In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering-packing dualities Covering problems Packing problems Minimum set cover Maximum set packing Minimum vertex cover Maximum matching Minimum edge cover Maximum independent set
Read “Matching (graph theory)” on English Wikipedia
Read “マッチング (グラフ理論)” on Japanese Wikipedia
Read “Matching (graph theory)” on DBpedia
Read “Matching (graph theory)” on English Wikipedia
Read “マッチング (グラフ理論)” on Japanese Wikipedia
Read “Matching (graph theory)” on DBpedia
Discussions
Log in to talk about this word.