1447 search results - page 61 / 290 » Graphs and Path Equilibria |
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
122
click to vote
SIAMAM
2008
15 years 3 months ago
2008
This paper proposes a macroscopic fluid dynamic model dealing with the flows of information on a telecommunication network with sources and destinations. The model consists of a co...
129
click to vote
FCT
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
116
click to vote
GBRPR
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
125
Voted
GD
2009
Springer
15 years 8 months ago
2009
Springer
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...