113 search results - page 4 / 23 » Spanning Trees and Shortest Paths in Monge Graphs |
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
CATA
2004
13 years 9 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
AIRS
2008
Springer
14 years 2 months ago
2008
Springer
Abstract. In this paper, we mainly explore the effectiveness of two kernelbased methods, the convolution tree kernel and the shortest path dependency kernel, for Chinese relation e...
IDA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
JGT
2007
13 years 7 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...