Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. 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 votes
1 answer
220 views

Finding shortest path for DAG using dynamic programming vs topological sort?

-1 votes
1 answer
44 views

Generating topological sequence from DAG with additional "not appearing before" constraints

-1 votes
1 answer
25 views

weighted graph separation algorithm proof

40 votes
9 answers
57k views

Algorithm to find diameter of a tree using BFS/DFS. Why does it work?

-1 votes
1 answer
49 views

Converting a Directed Acyclic Graph to a Directed Tree

0 votes
2 answers
53 views

Calculate shortest cycle that contains node $s$

2 votes
0 answers
45 views

Subgraph Isomorphism with Same Number of Nodes

7 votes
1 answer
260 views

Polynomial time algorithm for finding a maximal monotone subset

2 votes
1 answer
65 views

Efficient algorithm to count number of intersections of n sets

3 votes
1 answer
382 views

How to encode reachability in a graph with walls as a SAT problem

1 vote
2 answers
67 views

Are Control Flow Graphs(CFG) planar?

0 votes
2 answers
81 views

Prove there is an algorithm that needs at most n-1 comparisons to check if n-element array has all equal elements?

0 votes
1 answer
44 views

Calculate post dominator with non exiting control flow

0 votes
1 answer
33 views

Recursively deleting spanning forest from graph, how many iterations maximum to get to the empty graph?

Browse more Questions