1154 search results - page 91 / 231 » On the editing distance of graphs |
ICMCS
2005
IEEE
14 years 3 months ago
2005
IEEE
We use rhetorical annotations to specify a generation process that can assemble meaningful video sequences with a communicative goal and an argumentative progression. Our annotati...
ECEASST
2008
13 years 10 months ago
2008
Abstract: The diagram editor generator framework DIAMETA utilizes meta-modelbased language specifications and supports free-hand as well as structured editing. In this paper we pre...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
WAW
2004
Springer
14 years 3 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
DM
2008
13 years 10 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...