5473 search results - page 891 / 1095 » On the graph isomorphism problem |
158
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
172
click to vote
MIAR
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...
155
click to vote
MST
2010
15 years 4 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
186
click to vote
NETWORKS
2010
15 years 4 months ago
2010
Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...
190
click to vote
DATESO
2010
15 years 4 months ago
2010
Abstract. The high dimensionality of the data generated by social networks has been a big challenge for researchers. In order to solve the problems associated with this phenomenon,...