2294 search results - page 147 / 459 » From Path Graphs to Directed Path Graphs |
NIPS
2008
14 years 11 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
ICDE
2010
IEEE
15 years 9 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...
JCT
2008
14 years 10 months ago
2008
A graph G is k-linked if G has at least 2k vertices, and for every sequence x1, x2, . . . , xk, y1, y2, . . . , yk of distinct vertices, G contains k vertex-disjoint paths P1, P2,...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
WG
2009
Springer
15 years 4 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...