A backtracking algorithm to generate all kernels of a directed graph

DOI10.1080/00207168108803264MaRDI QIDQ3674074zbMATH OpenOpenAlexFDO

Authors C. N. Frangakis

Publication date 1981

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168108803264

zbMATH Keywords

backtracking algorithmdirected graphkernel

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• An Algorithm forr-Bases of a Directed Graph
• Estimating the Efficiency of Backtrack Programs
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3235858 (Why is no real title available?)

Cited in

(1)

• Enumerating the kernels of a directed graph with no odd circuits

This page was built for publication: A backtracking algorithm to generate all kernels of a directed graph

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