Abstract
In this paper the idea of temporal reachability in fuzzy directed graph is introduced. Temporality in fuzzy graphs is a generalization of a fuzzy graph on temporal relations, where the incidence property of graph vertices is changed in the discrete time. Reachability in such temporal graph structures refers to the ability to get from one vertex to another within different time moments and the reachability relation on fuzzy directed graph is the transitive closure on the edge set. Efficient processing queries and graph structured information under uncertainty is an important research topic especially in XML databases, geographical information systems (GIS), web mining and etc. Fuzzy temporal graph models are usually applied in geographical information systems to formalize relations between objects and to check connections between them. A method for searching temporal reachability in fuzzy graph structure is proposed, an example of finding a fuzzy reachability set in temporal graph is considered as well.
Sign-in/Register to access full text options 
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
