F# HashSet, Graph, Cognac

added by DotNetKicks
2/14/2017 2:29:26 PM

1 Kicks, 258 Views

The post on applying GPU to finding Eulerian path mentioned a stumbling block: partitioning a very specific kind of graph. In general, partitioning is a hard problem, NP-hard actually. The graphs we are dealing with are very specific, though, and may be partitioned in $latex O(|E|)$ time (E - the set of graph edges).


0 comments