Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:58, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving VLSI design and DNA sequencing problems using bipartization of graphs |
scientific article |
Statements
Solving VLSI design and DNA sequencing problems using bipartization of graphs (English)
0 references
19 June 2012
0 references
electronics
0 references
genomics
0 references
bipartite induced subgraph problem
0 references
polyhedral approach
0 references
branch-and-cut algorithm
0 references
