Computer Science Stack Exchange

1 vote

1 answer

19 views

Route planning on line segments which can be connected or not

GPrathap

111

modified 2 hours ago

1 vote

1 answer

38 views

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

CommunityBot

1

modified 11 hours ago

0 votes

1 answer

420 views

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

CommunityBot

1

modified 18 hours ago

0 votes

1 answer

895 views

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

CommunityBot

1

modified 21 hours ago

0 votes

1 answer

248 views

A path modification problem in directed graphs

CommunityBot

1

modified yesterday

0 votes

1 answer

270 views

Resource Allocation Graph: Two processes want the same resource

CommunityBot

1

modified yesterday

1 vote

1 answer

195 views

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

CommunityBot

1

modified yesterday

0 votes

0 answers

19 views

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

Subhankar Ghosal

292

asked yesterday

0 votes

0 answers

39 views

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

scubadude22

1

modified yesterday

0 votes

1 answer

578 views

Predecessor-subgraph property

CommunityBot

1

modified Mar 20 at 6:07

0 votes

1 answer

48 views

Bellman Ford may not update distance correctly by termination?

CommunityBot

1

modified Mar 17 at 12:03

1 vote

1 answer

54 views

Do Adjacency Lists from Binary Trees go both ways?

CommunityBot

1

modified Mar 16 at 12:07

0 votes

1 answer

40 views

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

T-Tory

9

modified Mar 15 at 11:41

0 votes

1 answer

63 views

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

Soha

15

modified Mar 14 at 11:48

Stack Exchange Network

Explore our questions

Route planning on line segments which can be connected or not

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

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

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

A path modification problem in directed graphs

Resource Allocation Graph: Two processes want the same resource

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

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

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

Predecessor-subgraph property

Bellman Ford may not update distance correctly by termination?

Do Adjacency Lists from Binary Trees go both ways?

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

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

Hot Network Questions