This is a preview. Log in through your library . Abstract A closure in a directed graph is a subset of nodes, all of whose successors belong to the subset. If each node has an assigned weight, which ...
Vol. 11, No. 3, Special Issue of the International Symposium on Nonlinear Analysis and Convex Analysis 2006 (August 2007), pp. 577-593 (17 pages) Published By: Mathematical Society of the Republic of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback