Abstract
A feedback arc set in a directed graph D is a set S of arcs in D such that D\ S is acyclic. The problem of determining a feedback arc set with least number of arcs is NP - complete for a general digraph. We define the strong feedback arc number ß <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> (G) for various orientations of an undirected graph G. The strong feedback arc problem of an undirected graph is to find a strong feedback arc set S of G(O) for some strongly oriented O(G) such that |S|=ß <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> (G) . In this paper our focus is on interconnection networks with ß <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> =1.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
