Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Graph Bipartization Problem with Applications to Via Minimization in VLSI Design

    https://doi.org/10.1142/S0129054122500198Cited by:0 (Source: Crossref)

    The bipartization problem for a graph G asks for finding a subset S of V(G) such that the induced subgraph G[S] is bipartite and |S| is maximized. This problem has significant applications in the via minimization of VLSI design. The problem has been proved NP-complete and the fixed parameter solvability has been known in the literature. This paper presents several polynomial-time algorithms for special graph families, such as split graphs, co-bipartite graphs, chordal graphs, and permutation graphs.

    Supported by National Key R&D Program of China (2019YFB2101604).

    Communicated by Yong Zhang

    Remember to check out the Most Cited Articles!

    Check out these Handbooks in Computer Science