scientific article
From MaRDI portal
Publication:3470486
zbMath0695.05029MaRDI QIDQ3470486
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (26)
An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph ⋮ Bounds on the hyperbolicity constant ⋮ Bounded-call broadcasting ⋮ Christmas tree: a versatile 1-fault-tolerant design for token rings ⋮ Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time ⋮ Large fault-tolerant interconnection networks ⋮ Steiner 4-diameter, maximum degree and size of a graph ⋮ Unnamed Item ⋮ Distance-based index structures for fast similarity search ⋮ Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity ⋮ Multidimensional linear congruential graphs ⋮ Shortcuts for the circle ⋮ A cut locus for finite graphs and the farthest point mapping ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems ⋮ Bounded edge-connectivity and edge-persistence of Cartesian product of graphs ⋮ Unnamed Item ⋮ Augmenting forests to meet odd diameter requirements ⋮ An explicit infinite family of \(\mathbb{M}\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)\log_{K-1}\mathbb{M}\) for each \(K-1\) a prime power] ⋮ A Hypercube Variant with Small Diameter ⋮ Improved approximability and non-approximability results for graph diameter decreasing problems ⋮ Unnamed Item ⋮ Complexity and algorithms for constant diameter augmentation problems ⋮ Toward Tight Approximation Bounds for Graph Diameter and Eccentricities ⋮ Graph theoretical issues in computer networks ⋮ Reducing the diameter of a unit disk graph via node addition
This page was built for publication:
