Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It only takes a minute to sign up.

Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top

Explore our Questions

1 answer
6 votes
206 views
Uniformly sampling or counting connected graph partitions with any number of blocks
1 answer
-2 votes
311 views
Find research partner (profession and beginner)
1 answer
6 votes
278 views
Complexity of optimal elimination for a planar tensor network
0 answers
16 votes
551 views
Linear-time algorithm to test if clique number equals degeneracy bound?
2 answers
1 vote
242 views
Node-weighted steiner problem with few terminals
0 answers
4 votes
289 views
Computational Complexity of cycle double cover
4 answers
35 votes
2k views
Why is "topological sorting" topological?
0 answers
0 votes
48 views
Fastest algorithm to compute maximum number of boxes that can fit inside each other
0 answers
0 votes
85 views
optimization on graph edges selection
2 answers
5 votes
462 views
Max cut problem between two connected subgraphs
0 answers
10 votes
122 views
Fastest Known Algorithm to Count Acyclic Orientations in a Graph
2 answers
3 votes
171 views
exact path cover for undirected graph
1 answer
2 votes
99 views
Can this special case of Node Weighted Steiner Tree be solved in polynomial time?
0 answers
1 vote
56 views
A reduction from the maximum $k$-closure problem to the clique problem
Browse more Questions