Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Facets of the balanced (acyclic) induced subgraph polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Bipartite Subgraph Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The haplotyping problem: an overview of computational models and solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wheel inequalities for stable set polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-theoretic via minimization algorithm for two-layer printed circuit boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Bipartization and via minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositions in the bipartite subgraph polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral results for the bipartite induced subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing in VLSI-layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly bipartite graphs and the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of weakly bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 09:33, 5 July 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
    0 references
    0 references
    19 June 2012
    0 references
    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