Abstract
Abstract We introduced in [4]a new decomposition scheme for bipartite graphs that we called canonical decomposition. Weak bisplit graphs are totally decomposable following this decomposition We give here the frame work for obtaining linear recognition algorithms for Weak bisplit graphs as well as for two sub families of this class the P-6 free bipartite graphs and the bicographs We conclude by presenting a list of NP-complete optimization problems for general bipartite graphs which they have efficient solutions when dealing with weak bisplit graphs
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.
