Explore our questions

0 votes
4 answers
821 views

O(m) time algorithm to check for a strongly connected graph

0 votes
3 answers
269 views

Why the APPROX-VERTEX-COVER algorithm is O(V+E)?

2 votes
1 answer
36 views

DFS (Depth-first search) vs BFS (Breadth-first search) Space Optimizations

1 vote
1 answer
62 views

Can Dijkstra's algorithm be used this way?

1 vote
1 answer
17 views

Algorithm for creating an esports season schedule

0 votes
1 answer
62 views

Is the set of all duals same as the set of all planar graphs?

1 vote
2 answers
114 views

NP-hardness of modified distance-colouring of graphs

0 votes
0 answers
16 views

Kernelization For Odd Cycle Transversal Problem on Perfect Graphs

1 vote
2 answers
136 views

Resolving a dependency graph with insufficient resources to store all states

1 vote
0 answers
113 views

Combining Computer Science and Humanities

1 vote
1 answer
161 views

Is doing BFS over transitive reduction of a directed acyclic graph equivalent to topological ordering of that graph?

0 votes
1 answer
26 views

Will CSR format store the all 0 column?

0 votes
1 answer
34 views

Coding the labyrinth solver

1 vote
1 answer
142 views

Covering maximal number of sets using fixed number of elements

Browse more Questions