A backtracking algorithm to generate all kernels of a directed graph

DOI10.1080/00207168108803264zbMATH Open0523.68059OpenAlexW2018614452MaRDI QIDQ3674074FDOQ3674074

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

kerneldirected graphbacktracking algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Estimating the Efficiency of Backtrack Programs
• Title not available (Why is that?)
• An Algorithm forr-Bases of a Directed Graph

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)