Graph Bipartization Problem with Applications to Via Minimization in VLSI Design
From MaRDI portal
Publication:6132388
Cites work
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1945152 (Why is no real title available?)
- Algorithmic graph theory and perfect graphs
- Combinatorial optimization. Theory and algorithms.
- Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
- Faster graph bipartization
- Finding odd cycle transversals.
- Graph Bipartization and via minimization
- Graph theory
- Maximum bipartite subgraph of geometric intersection graphs
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- Planar graph bipartization in linear time
- Solving VLSI design and DNA sequencing problems using bipartization of graphs
Cited in
(4)- scientific article; zbMATH DE number 2185598 (Why is no real title available?)
- Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays
- Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments
- scientific article; zbMATH DE number 88981 (Why is no real title available?)
This page was built for publication: Graph Bipartization Problem with Applications to Via Minimization in VLSI Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132388)
