Pages that link to "Item:Q4742710"
From MaRDI portal
The following pages link to A graph-theoretic via minimization algorithm for two-layer printed circuit boards (Q4742710):
Displayed 13 items.
- Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
- Edges and switches, tunnels and bridges (Q1028235) (← links)
- An algorithm for min-cost edge-disjoint cycles and its applications (Q1200787) (← links)
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis (Q1276973) (← links)
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- Polyhedral results for the bipartite induced subgraph problem (Q2433802) (← links)
- A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188) (← links)
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs (Q2813347) (← links)
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718) (← links)
- Randomized heuristics for the Max-Cut problem (Q4405937) (← links)