Abstract
The isomorphism problem for bipartite graphs is as computationally hard as the well-known isomorphism problem for arbitrary finite graphs, for which no polynomial algorithms are known. The paper proposes a polynomial generic algorithm for the bipartite graph isomorphism problem, which gives the correct answer on the set of almost all inputs, and gives an undefined answer on the rare remaining inputs.
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.
