« first day (4627 days earlier)      last day (29 days later) » 

Feeds
Feeds
02:43
2
Q: Finding unmatchable edges in a graph

NoahDefinition: An unmatchable edge is an edge that is not contained in any perfect matching of $G$. Problem: Given a graph $G = (V, E)$, find all unmatchable edges of $G$. Apparently this problem is solvable in $O(V^3)$ time. I was able to solve this problem for bipartite Graphs by finding a perfect...

algorithms graphs matching

« first day (4627 days earlier)      last day (29 days later) »