Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C90 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6048057 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
electronics | |||
| Property / zbMATH Keywords: electronics / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
genomics | |||
| Property / zbMATH Keywords: genomics / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bipartite induced subgraph problem | |||
| Property / zbMATH Keywords: bipartite induced subgraph problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
polyhedral approach | |||
| Property / zbMATH Keywords: polyhedral approach / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
branch-and-cut algorithm | |||
| Property / zbMATH Keywords: branch-and-cut algorithm / rank | |||
Normal rank | |||
Revision as of 22:32, 29 June 2023
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
