Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10589-010-9355-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2104881193 / rank | |||
Normal rank | |||
Revision as of 00:56, 20 March 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
