In this paper, we study the problem of determining the largest number of maximum independent sets of a graph of order n. Solutions to this problem are given for various classes of graphs, including ...

Ioana Zelina, Ioana Taşcu, Simple paths of maximum length in star graphs, Carpathian Journal of Mathematics, Vol. 24, No. 2 (2008), pp. 120-125 ...

Intel FGA gives developers a comprehensive set of tools to examine, debug, and analyze Intel TBB flow graphs.

With Kin's algorithm, all important network flow problems, including maximum flow and minimum cost problems, can now be treated as special cases of the minimum cost flow problem.