Pages that link to "Item:Q1373751"
From MaRDI portal
The following pages link to The Steiner tree packing problem in VLSI design (Q1373751):
Displaying 22 items.
- Graphs with large generalized (edge-)connectivity (Q339485) (← links)
- A solution to a conjecture on the generalized connectivity of graphs (Q512887) (← links)
- Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
- On routing in VLSI design and communication networks (Q944702) (← links)
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- On two generalized connectivities of graphs (Q1692646) (← links)
- Constructing edge-disjoint Steiner paths in lexicographic product networks (Q1738072) (← links)
- Steiner tree packing revisited (Q1935940) (← links)
- The minimum size of a graph with given tree connectivity (Q2227103) (← links)
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs (Q2341720) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Packing Steiner trees with identical terminal sets (Q2390272) (← links)
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs (Q2409788) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- Packing strong subgraph in digraphs (Q2684051) (← links)
- Path-connectivity of lexicographic product graphs (Q2804863) (← links)
- Packing the Steiner trees of a graph (Q3057108) (← links)
- The cavity approach for Steiner trees packing problems (Q3303270) (← links)
- A branch-and-price algorithm for switch-box routing (Q4785215) (← links)
- Directed Steiner tree packing and directed tree connectivity (Q6093140) (← links)
