1664 search results - page 82 / 333 » Distance labeling in graphs |
136
click to vote
MFCS
1998
Springer
15 years 8 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
107
click to vote
AIPS
2000
15 years 5 months ago
2000
We will discuss the shortcomings of known variable and value ordering strategies for Graphplan's backward search phase, and propose a novel strategy that is based on a notion...
118
click to vote
CCCG
2004
15 years 5 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
155
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
109
click to vote
INCDM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In a recommender system where users rate items we predict the rating of items users have not rated. We define a rating graph containing users and items as vertices and r...