5473 search results - page 632 / 1095 » On the graph isomorphism problem |
185
click to vote
CONSTRAINTS
2008
15 years 7 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
151
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
172
click to vote
DAM
2002
15 years 6 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
153
click to vote
DM
1998
15 years 6 months ago
1998
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloure...
163
click to vote
ATMOS
2010
15 years 5 months ago
2010
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...