Skip Navigation

The Computer Journal 1974 17(3):245-248; doi:10.1093/comjnl/17.3.245
© 1974 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dvorák, S.
Right arrow Articles by Kropác, B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Decomposition of the Gozinto's graph with the use of a nesting store

S. Dvorák * and B. Kropác *

The Computer Centre, Tesla Roznov, Roznov, Czechoslovakia

This paper describes a decomposition algorithm for finite oriented acyclic graphs, which makes use of a nesting store during its operations. The basic operation of the algorithm is partial splitting of the input list describing a graph or any partial graph. The described procedure proved to be very effective.

Received January 1973.

* The Computer Centre, Tesla Roznov, Roznov, Czechoslovakia


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.