Abstract
Let G = ( V, E) be a block graph. First we show that an algorithm for finding the path partition number p( G) by J.H. Yan and G.J. Chang gives wrong answers to some block graphs. Then we present an efficient algorithm for finding a minimum path partition of G (not just the path partition number p( G)). The complexity of this algorithm is O( m), where m = ¦E¦.
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.
