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 vote
1 answer
72 views

Cover a graph with complete subgraphs

-2 votes
0 answers
28 views

Extracting one induced subgraph of a given graph

3 votes
1 answer
244 views

Dynamic transitive closure with immediate new reachability facts

0 votes
0 answers
23 views

Minimum vertex-separators under edge addition

2 votes
0 answers
71 views

Does GHC use graph reduction?

0 votes
1 answer
38 views

Resources for first-order and second-order monadic logics with a model-checking objective

0 votes
0 answers
21 views

Maximum independent set in "subgraph-claw-free" graphs

1 vote
1 answer
228 views

Research and a career in origins of life

0 votes
1 answer
72 views

increasing minimum graph degree by adding edges

8 votes
3 answers
602 views

Is that edge orientation optimization problem NP-hard?

3 votes
1 answer
281 views

Is this node permutation optimization NP-Hard?

0 votes
0 answers
63 views

Maintaining a $K_{3,3}$-minor-free graph

0 votes
1 answer
47 views

Spectral sparsification of graphs with negative edge weights

3 votes
1 answer
101 views

Hardness of Maximum Independent Set in 3-Colorable Graphs

Browse more Questions