Diameter increase caused by edge deletion
From MaRDI portal
Publication:3789599
DOI10.1002/JGT.3190110315zbMATH Open0646.05038OpenAlexW2118748668WikidataQ59568120 ScholiaQ59568120MaRDI QIDQ3789599FDOQ3789599
Authors: Anneke A. Schoone, J. Van Leeuwen, Hans L. Bodlaender 
Publication date: 1987
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/16289
Recommendations
- scientific article; zbMATH DE number 736429
- Edge deletion preserving the diameter of the hypercube
- scientific article
- Decreasing the diameter of cycles
- Decreasing dilatation can increase dimension
- Dilation-optimal edge deletion in polygonal cycles
- Dilation-Optimal Edge Deletion in Polygonal Cycles
- Diameter-vital edges in a graph
- Graphs with small diameter after edge deletion
- Diameter vulnerability of graphs by edge deletion
Cites Work
Cited In (53)
- Finding diameter-reducing shortcuts in trees
- Bounds on the fault-diameter of graphs
- Title not available (Why is that?)
- An improved algorithm for diameter-optimally augmenting paths in a metric space
- Algorithms for radius-optimally augmenting trees in a metric space
- Algorithms for radius-optimally augmenting trees in a metric space
- Some diameter notions in lexicographic product of graphs
- Diameter vulnerability of graphs by edge deletion
- On the stability of the principal ratio
- Fast algorithms for diameter-optimally augmenting paths
- Title not available (Why is that?)
- The parametric complexity of graph diameter augmentation
- Vertex fusion under diameter constraints
- The diameter vulnerability of the generalized Petersen graphGP[tk;k]
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- Augmenting outerplanar graphs to meet diameter requirements
- A linear-time algorithm for radius-optimally augmenting paths in a metric space
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
- Reducing the diameter of a unit disk graph via node addition
- On diameter stability of the Johnson graph.
- Minimum Violation Vertex Maps and Their Applications to Cut Problems
- Mathematical programming models for some smallest-world problems
- Mixed covering of trees and the augmentation problem with odd diameter constraints
- Minimum cutsets in hypercubes
- Minimum diameter and tF(f, q)
- Decreasing the diameter of bounded degree graphs
- Graph classes with and without powers of bounded clique-width
- Edge-fault diameter of \(C_4\)-free graphs
- On the principal eigenvectors of uniform hypergraphs
- Some exact values for p(t, d)
- Diameter vulnerability of graphs
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
- Algorithms, Complexity, and Hans
- Vertex fusion under distance constraints
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
- Augmenting forests to meet odd diameter requirements
- Augmenting graphs to minimize the diameter
- Large fault-tolerant interconnection networks
- Title not available (Why is that?)
- Almost optimal algorithms for diameter-optimally augmenting trees
- Fractals for kernelization lower bounds
- Complexity and algorithms for constant diameter augmentation problems
- Title not available (Why is that?)
- Improved approximability and non-approximability results for graph diameter decreasing problems
- Augmenting graphs to minimize the radius
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
- Shortcutting directed and undirected networks with a degree constraint
- A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space
- Deterministic Models of Communication Faults
- Shortcuts for the circle
- Title not available (Why is that?)
- The Optimal Design of Low-Latency Virtual Backbones
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
This page was built for publication: Diameter increase caused by edge deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789599)
