Stack Exchange

Are AND&OR circuits P-complete?

cc.complexity-theory circuit-complexity Sep 4 '12 at 14:57 vzn

cstheory.stackexchange.com

18 votes

Where to get graphs to test my search algorithms against?

algorithms graphs data-sets benchmarking Aug 8 '12 at 23:01 Guy Coder

cs.stackexchange.com

17 votes

6 answers

Which SAT problems are easy?

cc.complexity-theory sat Feb 10 at 16:44 vzn

cstheory.stackexchange.com

16 votes

What is the counting complexity of random 2-SAT?

cc.complexity-theory counting-complexity random-k-sat Nov 17 '12 at 7:44 Community

cstheory.stackexchange.com

16 votes

Finding at least two paths of same length in a directed graph

complexity-theory graph-theory time-complexity graphs Jul 3 '12 at 20:59 jmad

cs.stackexchange.com

15 votes

How hard is counting the number of simple paths between two nodes in a directed graph?

algorithms complexity-theory graph-theory Mar 26 '12 at 5:19 Kaveh

cs.stackexchange.com

15 votes

NP-hardness of a graph partition problem?

cc.complexity-theory graph-theory graph-isomorphism Mar 5 '12 at 18:34 Mohammad Al-Turkistany

cstheory.stackexchange.com

14 votes

6 answers

When are two algorithms said to be “similar”?

ds.algorithms graph-algorithms Mar 13 '12 at 2:50 James Thompson

cstheory.stackexchange.com

14 votes

Axioms for Shortest Paths

graph-theory co.combinatorics graph-algorithms metrics Jul 27 '12 at 5:14 Mohammad

cstheory.stackexchange.com

14 votes

Measuring the difficulty of SAT instances

complexity-theory satisfiability heuristics Nov 27 '12 at 6:24 Juho

cs.stackexchange.com

13 votes

Why are perfect graphs called perfect?

graph-theory co.combinatorics terminology graph-colouring Nov 21 '12 at 17:13 vzn

cstheory.stackexchange.com

13 votes

Finding k shortest Paths with Eppstein's Algorithm

ds.algorithms graph-theory graph-algorithms directed-acyclic-graph Dec 10 '11 at 21:52 Community

cstheory.stackexchange.com

13 votes

3 answers

Shortest Equivalent CNF Formula

cc.complexity-theory co.combinatorics sat formulas Jan 25 '12 at 19:57 András Salamon

cstheory.stackexchange.com

12 votes

4 answers

The origin of the terms “efficient” and “feasible” computation/algorithm

cc.complexity-theory ds.algorithms ho.history-overview Aug 5 '12 at 19:02 JɛﬀE

cstheory.stackexchange.com

12 votes

0 answers

Approximation for counting the number of simple $s$-$t$ paths in a general graph

ds.algorithms reference-request graph-algorithms approximation-algorithms counting-complexity Jun 28 '12 at 14:44 Community

cstheory.stackexchange.com

11 votes

Find paths in a binary search tree summing to a target value

algorithm data-structures binary-tree Sep 16 '12 at 19:56 Gilles

stackoverflow.com

11 votes

9 answers

What are some problems where we know we have an optimal algorithm?

cc.complexity-theory ds.algorithms complexity-classes Jun 27 '12 at 16:33 aelguindy

cstheory.stackexchange.com

10 votes

Algorithm that finds the number of simple paths from $s$ to $t$ in $G$

algorithms graphs Aug 9 '12 at 22:57 Juho

cs.stackexchange.com

9 votes

Fastest known algorithm for finding simple paths through given set of vertices

ds.algorithms graph-algorithms time-complexity Jan 10 '12 at 14:11 Andreas Björklund

cstheory.stackexchange.com

0 answers

what is the best heuristic to solve 3AP with Euclidean costs?

ds.algorithms graph-algorithms heuristics Mar 27 '12 at 21:50 Kaveh

cstheory.stackexchange.com

Shortest paths disallowing each edge

ds.algorithms reference-request graph-algorithms Jun 1 '11 at 9:41 Jukka Suomela

cstheory.stackexchange.com

Graphs that cause DFS and BFS to process nodes in the exact same order

algorithms graphs graph-traversal Nov 28 '12 at 11:36 Community

cs.stackexchange.com

0 answers

Reducing the maximum degree in a graph

graph-theory graph-algorithms Dec 11 '12 at 17:18 Rachit

cstheory.stackexchange.com