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
0 answers
66 views

Tractability of computing generalized hypertreewidth on bounded arity hypergraphs

1 vote
1 answer
86 views

Efficient Algorithm for Partitioning a Directed Acyclic Graph into Short Paths

1 vote
0 answers
62 views

Generalization of the Hamiltonian path problem on Grid Graphs

2 votes
4 answers
6k views

Complexity of greedy coloring

0 votes
0 answers
81 views

5-color graph and minor

2 votes
1 answer
60 views

Upper Bound for distance-two chromatic number in terms of maximum degree

1 vote
0 answers
31 views

Application LCL definition to vertex coloration

4 votes
1 answer
83 views

Independent set queries with preprocessing

1 vote
1 answer
46 views

What is known about the complexity of Network Diversion?

0 votes
1 answer
57 views

What's the exact complexity of a DFS if we revisit nodes?

3 votes
1 answer
134 views

Approximative counting of matchings in a graph

3 votes
1 answer
179 views

What is the treewidth of the 3D-grid (mesh or lattice) with sidelength n?

1 vote
1 answer
199 views

Graph partitioning to minimize sum of intra-partition edge weights

1 vote
0 answers
44 views

Notion between connected and strongly connected graphs

Browse more Questions