Abstract
Series-parallel networks are often used as models for electric circuits. The authors use series-parallel graphs to represent series-parallel networks. Since, there are many different graph representations for a series-parallel networks, they are interested in studying maximum matching in different graph representations of a single network. The number of edges in a maximum matching of G is called the edge independence number of G ad denoted by beta (G). For a network N, the maximum matching number, beta (N), is defined to be max( beta (G(N))) where G(N) is a graph representation for N. The minimum matching number, beta *(N), is defined to be min( beta (G(N))). The authors present linear time algorithms to compute beta (N) and beta *(N) for any series-parallel network N. >
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.
