Diameter increase caused by edge deletion
From MaRDI portal
Publication:3789599
Recommendations
- scientific article; zbMATH DE number 736429
- Edge deletion preserving the diameter of the hypercube
- scientific article; zbMATH DE number 5289558
- 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
Cited in
(51)- Bounds on the fault-diameter of graphs
- Vertex fusion under distance constraints
- On the stability of the principal ratio
- Reducing the diameter of a unit disk graph via node addition
- Decreasing the diameter of bounded degree graphs
- Minimum violation vertex maps and their applications to cut problems
- Augmenting forests to meet odd diameter requirements
- On diameter stability of the Johnson graph.
- Diameter vulnerability of graphs
- Augmenting graphs to minimize the radius
- Vertex fusion under diameter constraints
- Fast algorithms for diameter-optimally augmenting paths
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- Shortcuts for the circle
- Fast algorithms for diameter-optimally augmenting paths and trees
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
- Algorithms, Complexity, and Hans
- A linear-time algorithm for radius-optimally augmenting paths in a metric space
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
- Some exact values for \(p(t,d)\)
- Large fault-tolerant interconnection networks
- scientific article; zbMATH DE number 4008432 (Why is no real title available?)
- Deterministic Models of Communication Faults
- Almost optimal algorithms for diameter-optimally augmenting trees
- Minimum cutsets in hypercubes
- Fractals for kernelization lower bounds
- Finding diameter-reducing shortcuts in trees
- Mixed covering of trees and the augmentation problem with odd diameter constraints
- Shortcuts for the circle
- Graph classes with and without powers of bounded clique-width
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
- A linear-time algorithm for discrete radius optimally augmenting paths in a metric space
- Minimum diameter and tF(f, q)
- Augmenting outerplanar graphs to meet diameter requirements
- Complexity and algorithms for constant diameter augmentation problems
- Algorithms for radius-optimally augmenting trees in a metric space
- Algorithms for radius-optimally augmenting trees in a metric space
- scientific article; zbMATH DE number 7057487 (Why is no real title available?)
- The optimal design of low-latency virtual backbones
- Mathematical programming models for some smallest-world problems
- Edge-fault diameter of \(C_4\)-free graphs
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
- Some diameter notions in lexicographic product
- On the principal eigenvectors of uniform hypergraphs
- Shortcutting directed and undirected networks with a degree constraint
- Almost optimal algorithms for diameter-optimally augmenting trees
- Diameter vulnerability of graphs by edge deletion
- The diameter vulnerability of the generalized Petersen graph \(GP[tk,k]\)
- Improved approximability and non-approximability results for graph diameter decreasing problems
- scientific article; zbMATH DE number 736429 (Why is no real title available?)
- The parametric complexity of graph diameter augmentation
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)
