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

Route planning on line segments which can be connected or not

1 vote
1 answer
38 views

Are there any established methods for generating random graphs/networks that are both planar and meshlike?

0 votes
1 answer
420 views

How to deal with cost variation in a dynamic graph when applying Dijkstra

0 votes
1 answer
895 views

Find a path that contains specific nodes without back and forward edges

0 votes
1 answer
248 views

A path modification problem in directed graphs

0 votes
1 answer
270 views

Resource Allocation Graph: Two processes want the same resource

1 vote
1 answer
195 views

A pathfinding algorithm for graphs in which arc weights can change over time

0 votes
0 answers
19 views

How to generate all possible colour vectors generated by greedy colouring on a graph?

0 votes
0 answers
39 views

Budgeted min cost max flow in bipartite where the flows must also be a matching set

0 votes
1 answer
578 views

Predecessor-subgraph property

0 votes
1 answer
48 views

Bellman Ford may not update distance correctly by termination?

1 vote
1 answer
54 views

Do Adjacency Lists from Binary Trees go both ways?

0 votes
1 answer
40 views

Correct Term for describing "diamond" subgraphs in a Directed Acyclic Graph

0 votes
1 answer
63 views

Is maximal independent set on maximal planar graphs still NP-complete?

Browse more Questions