By Topic

Minimum Feedback Arc and Vertex Sets of a Directed Graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

To determine a minimum set of arcs of an arbitrary directed graph which, if removed, leave the graph without directed circuits, is an outstanding problem in graph theory. A related problem is that of finding a minimum set of vertices which, if removed together with their incident arcs, leave the graph with no directed circuits. A closed form solution of both problems is presented. The determination of those minimum sets for a graph with n vertices involves the expansion of an n-th order permanent and some algebraic manipulations of the resultant expression, subject to the absorption laws of Boolean algebra. The proposed procedure renders all possible solutions simultaneously.

Published in:

IEEE Transactions on Circuit Theory  (Volume:13 ,  Issue: 4 )