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

DOI10.1093/COMJNL/19.4.326MaRDI QIDQ4109293zbMATH OpenOpenAlexFDO

Authors Carter Bays

Publication date 1976

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/19.4.326

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) General topics in the theory of software (68N01) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)

Cited in

(2)

• Depth-first K-trees and critical path analysis
• String representations of graphs

This page was built for publication: A non-recursive technique for recreating a digraph from its K-formula representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4109293)