821 search results - page 12 / 165 » Addressing the Petersen graph |
103
click to vote
MFCS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
ICMT
2009
Springer
15 years 6 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...
100
click to vote
BIRTHDAY
2008
Springer
15 years 1 months ago
2008
Springer
We illustrate two ways to address the specification, modelling and analysis of dynamic software architectures using: i) ordinary typed graph transformation techniques implemented i...
ICML
2010
IEEE
15 years 24 days ago
2010
IEEE
In this paper, we address the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud. Cr...
105
click to vote
GBRPR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...