Abstract

We introduce BF-orderable graphs as a generalization of acyclic graphs. BF-orderable graphs permit a linear time solution to the single source shortest path problem. We give a graph-theoretic characterization of BF-orderable graphs by forbidden subgraphs.

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

Disclaimer: 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.