1154 search results - page 63 / 231 » On the editing distance of graphs |
CCCG
2004
13 years 11 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...
ALGORITHMICA
2010
13 years 10 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 ...
WADS
2009
Springer
14 years 4 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
INCDM
2007
Springer
14 years 4 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...
SIGMOD
2002
ACM
14 years 10 months ago
2002
ACM
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...