Graph Bipartization Problem with Applications to Via Minimization in VLSI Design (Q6132388)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph Bipartization Problem with Applications to Via Minimization in VLSI Design |
scientific article; zbMATH DE number 7728369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph Bipartization Problem with Applications to Via Minimization in VLSI Design |
scientific article; zbMATH DE number 7728369 |
Statements
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design (English)
0 references
16 August 2023
0 references
bipartite induced subgraph
0 references
odd-cycle transversal
0 references
via minimization
0 references
VLSI design
0 references
polynomial-time algorithm
0 references
0 references
0 references
