Abstract
Given a graph and a weight function which associates to each path an element of a Q-semiring, an essential set of arcs is defined as the complement of a maximal set of arcs which can be removed from the graph without changing the weight of the optimal paths for any pair of vertices. Conditions are given under which a graph admits a unique set of essential arcs and an algorithm is proposed to test for this condition and find this set of arcs.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
