Informatica logo


Login Register

  1. Home
  2. Issues
  3. Volume 3, Issue 3 (1992)
  4. The overlappingly decomposed networks

Informatica

Information Submit your article For Referees Help ATTENTION!
  • Article info
  • Related articles
  • More
    Article info Related articles

The overlappingly decomposed networks
Volume 3, Issue 3 (1992), pp. 360–377
Kęstutis Lašinskas  

Authors

 
Placeholder
https://doi.org/10.3233/INF-1992-3304
Pub. online: 1 January 1992      Type: Research Article     

Published
1 January 1992

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.

Related articles PDF XML
Related articles PDF XML

Copyright
No copyright data available.

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

Metrics
since January 2020
324

Article info
views

0

Full article
views

188

PDF
downloads

173

XML
downloads

Export citation

Copy and paste formatted citation
Placeholder

Download citation in file


Share


RSS

INFORMATICA

  • Online ISSN: 1822-8844
  • Print ISSN: 0868-4952
  • Copyright © 2023 Vilnius University

About

  • About journal

For contributors

  • OA Policy
  • Submit your article
  • Instructions for Referees
    •  

    •  

Contact us

  • Institute of Data Science and Digital Technologies
  • Vilnius University

    Akademijos St. 4

    08412 Vilnius, Lithuania

    Phone: (+370 5) 2109 338

    E-mail: informatica@mii.vu.lt

    https://informatica.vu.lt/journal/INFORMATICA
Powered by PubliMill  •  Privacy policy