Last call to make your voice heard! Our 2022 Developer Survey closes in less than a week. Take survey.

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

0 votes
1 answer
55 views

Is there FPT or XP algorithms knowm for Shortest Steiner cycle and $(a,b)$-Steiner path problem

1 vote
0 answers
44 views

Is there an FPT or XP algorithm known for this version of $k$-edge disjoint paths problem?

1 vote
0 answers
53 views

Cheapest Insertion is $2$-approximation for TSP

0 votes
0 answers
87 views

Separation oracle for breaking cycles in directed graph

4 votes
1 answer
77 views

Tensor network contraction "bubbling": why are some approaches more computationally efficient than others (question from a beginner)

0 votes
0 answers
34 views

Is there an MMSNP formula for 3-colouring?

1 vote
0 answers
14 views

Locally bijective homomorphism between locally-H graphs

2 votes
0 answers
58 views

Is k-ACYCLIC COLOURABLITY in CSP?

0 votes
0 answers
43 views

Locally bijective homomorphism between line graphs

0 votes
0 answers
64 views

Does the Christofides algorithm ensure this inequality?

0 votes
0 answers
34 views

On infinite bipartite graphs with no infinite rays

14 votes
1 answer
347 views

Generating Graphs with Trivial Automorphisms

0 votes
0 answers
19 views

2-connectivity of dual of a minimal cut in a bounded genus graph

2 votes
1 answer
112 views

Is the center of a BFS tree a good approximation of the graphs center?

Browse more Questions