مرکز منطقه ای اطلاع رساني علوم و فناوري

DocumentCode :

1180632

Title :

Enumerating all simple paths in a graph

Author :

Rubin, Frank

Volume :

Issue :

fYear :

1978

fDate :

8/1/1978 12:00:00 AM

Firstpage :

641

Lastpage :

642

Abstract :

Warshail\´s Theorem is used to obtain a matrix power algorithm for enumerating all simple paths in a graph. The algorithm uses $O(N^{3})$ matrix operations, compared to $O(N^{4})$ operations for previous algorithms.

Keywords :

Graph theory; Circuits; Costs; Data processing; Power generation;

fLanguage :

English

Journal_Title :

Circuits and Systems, IEEE Transactions on

Publisher :

ieee

ISSN :

0098-4094

Type :

jour

DOI :

10.1109/TCS.1978.1084515

Filename :

1084515

Link To Document :

https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1180632