Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10589-010-9355-1 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10589-010-9355-1 / rank | |||
Normal rank | |||
Latest revision as of 18:18, 9 December 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
0 references
0 references
