You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

The overlappingly decomposed networks

Article type: Research Article

Authors: Lašinskas, Kęstutis

Affiliations: Institute of Mathematics and Informatics, 2600 Vilnius, Akademijos St. 4, Lithuania

Abstract: The special class of networks are presented. Based on unreachable parts of subgraphs the overlappingly decomposed networks are defined. The special decomposition scheme of those networks is applicated for shortest path problem, dynamic programming and synthetic neural nets architecture.

Keywords: networks connectivity, unreachable nodes, subnetwork, shortest path, matroid, synthetic neural network

DOI: 10.3233/INF-1992-3304

Journal: Informatica, vol. 3, no. 3, pp. 360-377, 1992

Published: 1992
Price: EUR 27.50
Show more