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

5 votes
1 answer
480 views

Can Lexicographic BFS be implemented in logspace?

-1 votes
1 answer
75 views

Representation of binary strings by graphs and hypergraphs

1 vote
1 answer
622 views

Generate TSP instances with known optimal

-1 votes
1 answer
71 views

Generating grammar from a string

0 votes
1 answer
68 views

A variation of the longest path problem

3 votes
0 answers
70 views

FPRAS to estimate the probability to get a cyclic subgraph of a directed graph

3 votes
1 answer
325 views

Dynamic transitive closure with immediate new reachability facts

1 vote
1 answer
103 views

Efficient Algorithm for Partitioning a Directed Acyclic Graph into Short Paths

0 votes
1 answer
65 views

Is this edge-partitioning NP-Hard?

1 vote
1 answer
222 views

How do you achieve linear time complexity of greedy graph coloring?

0 votes
0 answers
64 views

Enumerating all set covers with sets of size at most two

4 votes
1 answer
63 views

Complexity of maximum k-edge-colorable subgraph of a bipartite graph

0 votes
1 answer
102 views

Complexity and Algorithm for specific Vertex Separator Problem

3 votes
1 answer
98 views

Running time analysis of problems with a variable in problem definition

Browse more Questions