Asymptotic Enumeration of Predicate-Junction Flowgraphs

DOI10.1017/S0963548300001991zbMath0857.68080OpenAlexW2117329956WikidataQ56502744 ScholiaQ56502744MaRDI QIDQ4715267

Colin Cooper

Publication date: 18 February 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300001991

zbMATH Keywords

unlabelled flowgraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)

Related Items (1)

On the 2‐cyclic property in 2‐regular digraphs

Cites Work

• Enumeration of structured flowcharts
• The Asymptotic Number of Unlabelled Regular Graphs
• Flow diagrams, turing machines and languages with only two formation rules
• Unnamed Item

This page was built for publication: Asymptotic Enumeration of Predicate-Junction Flowgraphs