User virgi

31 votes

Open problems on the frontiers of TCS

answered Sep 6, 2010 at 7:56

28 votes

Accepted

Optimal algorithm for finding the girth of a sparse graph?

answered Apr 6, 2012 at 21:55

23 votes

Accepted

Complexity of Finding the Eigendecomposition of a Matrix

answered Nov 9, 2010 at 8:58

19 votes

Accepted

Does an algorithm exist to efficiently maintain connectedness information for a DAG in presence of inserts/deletes?

answered Feb 27, 2011 at 1:24

18 votes

Accepted

Shortest paths disallowing each edge

answered May 31, 2011 at 21:35

16 votes

Accepted

Complexity of computing the average distance of a graph

answered Apr 28, 2013 at 18:39

15 votes

Accepted

What is the name of this type of directed graph problem?

answered Apr 11, 2011 at 0:13

15 votes

Problems Between P and NPC

answered Aug 24, 2010 at 1:07

14 votes

Accepted

Parallel algorithms for directed st-connectivity

answered Sep 22, 2010 at 15:42

11 votes

Multiplicative version of 3-SUM

answered Oct 20, 2010 at 19:54

10 votes

Accepted

What bounds can be put on counting reachable nodes in a dag?

answered Sep 5, 2010 at 5:11

10 votes

Transitivity check vs. Transitive Closure

answered Mar 13, 2014 at 0:12

10 votes

What is the fastest deterministic algorithm for dynamic digraph reachability with no edge deletion?

answered Jan 12, 2013 at 8:09

9 votes

"Directed" problems that are easier than their "undirected" variant.

answered Dec 4, 2011 at 2:34

9 votes

Any algorithmic problem has a time complexity dominated by counting?

answered Mar 31, 2011 at 22:12

6 votes

All Pairs Shortest Path - Directed graph with integer weights

answered Jan 12, 2013 at 7:52

5 votes

Solving Superstring Exactly

answered Jan 6, 2012 at 19:25

5 votes

Route existence between n pairs of nodes

answered Mar 23, 2011 at 18:09

4 votes

Computing a transitive completion / path existence oracle

answered Jul 19, 2014 at 22:51

Stack Exchange Network

19 Answers

Open problems on the frontiers of TCS

Optimal algorithm for finding the girth of a sparse graph?

Complexity of Finding the Eigendecomposition of a Matrix

Does an algorithm exist to efficiently maintain connectedness information for a DAG in presence of inserts/deletes?

Shortest paths disallowing each edge

Complexity of computing the average distance of a graph

What is the name of this type of directed graph problem?

Problems Between P and NPC

Parallel algorithms for directed st-connectivity

Multiplicative version of 3-SUM

What bounds can be put on counting reachable nodes in a dag?

Transitivity check vs. Transitive Closure

What is the fastest deterministic algorithm for dynamic digraph reachability with no edge deletion?

"Directed" problems that are easier than their "undirected" variant.

Any algorithmic problem has a time complexity dominated by counting?

All Pairs Shortest Path - Directed graph with integer weights

Solving Superstring Exactly

Route existence between n pairs of nodes

Computing a transitive completion / path existence oracle