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

DOI10.1093/comjnl/19.4.326zbMath0341.68028OpenAlexW2162708899MaRDI QIDQ4109293

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

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

Related Items (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