AN EFFICIENT ALGORITHM FOR CHECKING PATH EXISTENCE BETWEEN GRAPH VERTICES
| dc.contributor.author | Arman, Nabil | |
| dc.date.accessioned | 2017-01-23T07:47:35Z | |
| dc.date.accessioned | 2022-05-22T08:26:44Z | |
| dc.date.available | 2017-01-23T07:47:35Z | |
| dc.date.available | 2022-05-22T08:26:44Z | |
| dc.date.issued | 2005 | |
| dc.description.abstract | The development of efficient algorithms to determine path existence between vertices in a directed graph has attracted a large amount of research efforts due to the important role of these algorithms in many application domains, including deductive databases, rule bases verification, and graph theory to name a few. These algorithms are very crucial to answer certain queries about the path existence between any two graph vertices. This paper presents an efficient algorithm to determine the path existence between graph vertices by utilizing a special matrix representation of the graph. | en_US |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/7790 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | 6th International Arab Conference on Information Technology (ACIT’2005) | en_US |
| dc.subject | Graph Algorithms, Path Existence Query. | en_US |
| dc.title | AN EFFICIENT ALGORITHM FOR CHECKING PATH EXISTENCE BETWEEN GRAPH VERTICES | en_US |
| dc.type | Article | en_US |