General topological results on the construction of a minimum essential set of a directed graph
From MaRDI portal
Publication:3877712
DOI10.1109/TCS.1980.1084814zbMath0437.05028MaRDI QIDQ3877712
Publication date: 1980
Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)
algorithmdirected graphminimum feedback vertex setgeneral topological resultsminimum essential setstrongly adjacent polygons
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (2)
A polyhedral approach to the feedback vertex set problem ⋮ On simulation and optimization of macroeconometric models
This page was built for publication: General topological results on the construction of a minimum essential set of a directed graph
