Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
76 views

Shortest path on graphs

I would like to now if there has been any work on related problems, that is, shortest path problem in dynamically evolving graphs.
Philippe Ines's user avatar
10 votes
1 answer
308 views

In what area of study does one encounter this principle in timetabling?

A while ago I saw an image like the one below in a lecture, which was supposed to represent a rail network in a (square) city: The circles represent trains that are moving either North/South or East/...
Tom Solberg's user avatar
  • 4,049
2 votes
0 answers
1k views

Incremental minimum spanning tree

Given a connected graph $G=(V,E)$ with a weight function $w:E\to\mathbb{R}$ and a subset $E_0\subseteq E$ such that the subgraph $(V,E_0)$ is connected, I am looking for a sequence $E_0\subseteq E_1\...
Thomas Kalinowski's user avatar