Abstract: This paper abstracts three practical maximum problems from the real world and gives their formal mathematical descriptions. Their algorithms and complexity are fully discussed. In addition, the authors have got a useful result(?)t can be decided in polynomial time, for any graph, whether there exists a set of vertex-disjoint circuits such that every node of the graph is in one of the circuits.