230 search results - page 24 / 46 » Time Varying Undirected Graphs |
107
click to vote
CP
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
IV
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper describes a paradigm for visualising time deflow in a network of objects connected by abstract relationships (a graph) by representing time in the third dimension. We ...
FCT
2005
Springer
15 years 5 months ago
2005
Springer
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
100
click to vote
ECML
2004
Springer
15 years 4 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
113
click to vote
CATS
1998
15 years 27 days ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...