Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453)
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: Solving VLSI design and DNA sequencing problems using bipartization of graphs |
scientific article; zbMATH DE number 6048057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving VLSI design and DNA sequencing problems using bipartization of graphs |
scientific article; zbMATH DE number 6048057 |
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
0.7572278380393982
0 references
0.7240692973136902
0 references
