AGT We are interested in developing recognition algorithm for graph and digraph classes. We are interested in graph homomorphism problems and graph partitioning problems which they generalize several of known combinatorial problems(e.g. colouring problem). Several of complex problems arise in network design are modelled as problem in digraphs which require approximate or randomized solution. Our goal is to develop such algorithms that are interesting from theoretical and practical perspectives.