scientific article; zbMATH DE number 1321108
From MaRDI portal
Publication:4257150
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10) Applications of graph theory to circuits and networks (94C15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Recommendations
Cited in
(33)- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- Directed Steiner tree packing and directed tree connectivity
- Efficient preprocessing for VLSI optimization problems
- Two lower bounds for generalized 3-connectivity of Cartesian product graphs
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- A solution to a conjecture on the generalized connectivity of graphs
- Constructing internally disjoint pendant Steiner trees in Cartesian product networks
- An algebraic multigrid-based algorithm for circuit clustering
- Path-connectivity of lexicographic product graphs
- Multiscale optimization in VLSI physical design automation
- The generalized 3-connectivity of graph products
- On finding an empty staircase polygon of largest area (width) in a planar point-set
- Conflict-free coloring of string graphs
- A tutorial on geometric programming
- Efficient cell-based migration of VLSI layout
- The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
- Directed cycle \(k\)-connectivity of complete digraphs and complete regular bipartite digraphs
- An ILP based hierarchical global routing approach for VLSI ASIC design
- Graphs with large generalized (edge-)connectivity
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
- On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
- Improved bounds for colouring circle graphs
- Handbook of Algorithms for Physical Design Automation
- scientific article; zbMATH DE number 595444 (Why is no real title available?)
- Placement by thermodynamic simulated annealing
- Packing strong subgraph in digraphs
- Finding geometric representations of apex graphs is \textsf{NP}-hard
- The generalized \(3\)-connectivity of exchanged crossed cube
- On two generalized connectivities of graphs
- The \(\kappa_k\)-connectivity of line graphs
- Generalized 3-edge-connectivity of Cartesian product graphs.
- On routing in VLSI design and communication networks
- Typical representatives of free homotopy classes in multi-punctured plane
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4257150)
