Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top Users
Digests
narek Bojikian
top
accounts
reputation
activity
subscriptions
Top Questions
8
votes
Compute the expected size of an approximation of vertex cover
graphs
approximation
probability-theory
randomized-algorithms
vertex-cover
asked Jan 2, 2020 at 5:28
cs.stackexchange.com
6
votes
An example where the algorithm of Hopcroft and Karp performs poorly?
algorithms
graphs
lower-bounds
bipartite-matching
fine-grained-analysis
asked Oct 30, 2019 at 2:20
cs.stackexchange.com
5
votes
Hardness of finding if a vertex lies on a simple directed path between two vertices
graph-theory
graph-algorithms
np-hardness
disjoint-paths
asked Dec 19, 2019 at 0:30
cstheory.stackexchange.com
Top Answers
56
Why is English not a regular language?
cs.stackexchange.com
11
Examples of simple/common problems with quadratic running time
cs.stackexchange.com
9
Counting number of paths between two vertices in a DAG
cs.stackexchange.com
7
What is the point of traversing a binary tree in preoder, inorder or postorder?
cs.stackexchange.com
7
Shortest paths between given red vertices and arbitrary blue vertices
cs.stackexchange.com
6
Hardness of finding if a vertex lies on a simple directed path between two vertices
cstheory.stackexchange.com
6
Linear algorithm to measure how sorted an array is
cs.stackexchange.com
5
Being stuck and frustrated with my masters project
cs.stackexchange.com
5
Algorithm to find a set of nodes with a smaller set of neighbours in a bipartite graph
cs.stackexchange.com
Stack Exchange works best with JavaScript enabled
cs.stackexchange.com
cstheory.stackexchange.com