scientific article; zbMATH DE number 1321108
From MaRDI portal
Publication:4257150
zbMath0926.68059MaRDI QIDQ4257150
Publication date: 5 August 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Applications of graph theory to circuits and networks (94C15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items (27)
Improved bounds for colouring circle graphs ⋮ 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\) ⋮ Directed Steiner tree packing and directed tree connectivity ⋮ On two generalized connectivities of graphs ⋮ Packing strong subgraph in digraphs ⋮ The \(\kappa_k\)-connectivity of line graphs ⋮ On finding an empty staircase polygon of largest area (width) in a planar point-set ⋮ Finding geometric representations of apex graphs is \textsf{NP}-hard ⋮ An algebraic multigrid-based algorithm for circuit clustering ⋮ Placement by thermodynamic simulated annealing ⋮ The generalized 3-connectivity of graph products ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ An ILP based hierarchical global routing approach for VLSI ASIC design ⋮ On routing in VLSI design and communication networks ⋮ A solution to a conjecture on the generalized connectivity of graphs ⋮ Efficient preprocessing for VLSI optimization problems ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ Conflict-free coloring of string graphs ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ Path-connectivity of lexicographic product graphs ⋮ A tutorial on geometric programming ⋮ Typical representatives of free homotopy classes in multi-punctured plane ⋮ Generalized 3-edge-connectivity of Cartesian product graphs ⋮ Two lower bounds for generalized 3-connectivity of Cartesian product graphs ⋮ Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
This page was built for publication:
