2294 search results - page 98 / 459 » From Path Graphs to Directed Path Graphs |
WG
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
118
click to vote
COMBINATORICA
2011
13 years 9 months ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
101
click to vote
WINE
2005
Springer
15 years 3 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
IADIS
2004
14 years 11 months ago
2004
The main topic addressed in this paper is how to help a learner plan a navigation path in self-directed learning on the Web. Our approach to this issue is to analyze the open-ende...
GBRPR
2007
Springer
15 years 4 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...