A lonesome knight on a vivid mathematical journey...
Top network posts
- 10 Path in an edge-weighted undirected graph
- 10 Path in a vertex-weighted undirected graph
- 10 Why are there no complete problems for NP ∩ coNP?
- 8 Is there an efficient algorithm for determining whether or not a graph has a non-trivial automorphism?
- 8 Karp hardness of digraph coloring without monochromatic dicycle
- 7 Finding the minimum vertex cover of planar graph given the planar representation
- 7 Karp hardness of a diameter-decreasing planted clique
- View more network posts →
This user doesn’t have any gold badges yet.