3471 search results - page 141 / 695 » Obstacle Numbers of Graphs |
SODA
2008
ACM
13 years 11 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
AAAI
2006
13 years 11 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
DM
2008
13 years 9 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...
JCP
2008
13 years 9 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
ICMT
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...