Graph Bipartization Problem with Applications to Via Minimization in VLSI Design
From MaRDI portal
Publication:6132388
DOI10.1142/s0129054122500198OpenAlexW4287219802MaRDI QIDQ6132388
Publication date: 16 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054122500198
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving VLSI design and DNA sequencing problems using bipartization of graphs
- Finding odd cycle transversals.
- Maximum bipartite subgraph of geometric intersection graphs
- Algorithmic graph theory and perfect graphs
- Faster graph bipartization
- Planar graph bipartization in linear time
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs
- Graph Bipartization and via minimization
- Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
- Combinatorial optimization. Theory and algorithms.