Skip Navigation

The Computer Journal 1976 19(4):326-328; doi:10.1093/comjnl/19.4.326
© 1976 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 arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bays, C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A non-recursive technique for recreating a digraph from its K-formula representation

C. Bays *

University of Oklahoma, Norman, Oklahoma, USA

The K-formula notation is a compact representation introduced by Berztiss which may be used to describe any digraph. The techniques described in this paper are not recursive, yet recreate the diagraph from its K-formula representation by making a single right to left scan over the K-formula. The resultant graph may then be written out as a series of arcs (ordered pairs), or may be manipulated internally as a list.

Received June 1974.

* University of Oklahoma, Norman, Oklahoma


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.