3 search results - page 1 / 1 » An algorithm to increase the node-connectivity of a digraph ... |
DISOPT
2008
13 years 5 months ago
2008
AINA
2009
IEEE
13 years 11 months ago
2009
IEEE
—One of the main advantages of clustering algorithms is the ability to allow networks to be physically divided into smaller regions, thereby increasing the theoretical maximum nu...
ATMOS
2007
13 years 6 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...