Abstract
Based on rough graph theory, this paper gives a new algorithm in rough network, which generalizes the classical algorithm of exploring maximum flow. This algorithm successfully deals with a kind of complex relationship mining problem between different relationship levels. Simulation shows the effectiveness of this algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
