Pages that link to "Item:Q3789599"

The following pages link to Diameter increase caused by edge deletion (Q3789599):

Displaying 48 items.

• On the principal eigenvectors of uniform hypergraphs (Q331188) (← links)
• Augmenting graphs to minimize the diameter (Q494792) (← links)
• Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
• Shortcuts for the circle (Q670711) (← links)
• Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
• Algorithms for radius-optimally augmenting trees in a metric space (Q832891) (← links)
• Graph classes with and without powers of bounded clique-width (Q896650) (← links)
• Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
• Bounded edge-connectivity and edge-persistence of Cartesian product of graphs (Q967381) (← links)
• Diameter vulnerability of graphs by edge deletion (Q1011748) (← links)
• Vertex fusion under distance constraints (Q1039434) (← links)
• Large fault-tolerant interconnection networks (Q1120553) (← links)
• On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems (Q1196217) (← links)
• Minimum cutsets in hypercubes (Q1763354) (← links)
• Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
• Almost optimal algorithms for diameter-optimally augmenting trees (Q2167895) (← links)
• Minimizing the continuous diameter when augmenting a geometric tree with a shortcut (Q2206728) (← links)
• Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
• The parametric complexity of graph diameter augmentation (Q2446345) (← links)
• Augmenting forests to meet odd diameter requirements (Q2506822) (← links)
• Mathematical programming models for some smallest-world problems (Q2572112) (← links)
• Augmenting Outerplanar Graphs to Meet Diameter Requirements (Q2862552) (← links)
• Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
• Vertex fusion under diameter constraints (Q3503481) (← links)
• Deterministic Models of Communication Faults (Q3599115) (← links)
• Decreasing the diameter of bounded degree graphs (Q4521485) (← links)
• Fractals for Kernelization Lower Bounds (Q4609787) (← links)
• The diameter vulnerability of the generalized Petersen graphGP[tk;k] (Q4633381) (← links)
• Some diameter notions in lexicographic product of graphs (Q5009987) (← links)
• A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space (Q5012871) (← links)
• Some exact values for <i>p</i>(<i>t</i><b>,</b> <i>d</i>) (Q5034539) (← links)
• Minimum diameter and <i>t_F</i>(<i>f, q</i>) (Q5035805) (← links)
• Algorithms, Complexity, and Hans (Q5042448) (← links)
• (Q5091032) (← links)
• (Q5136224) (← links)
• Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
• The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
• (Q5377025) (← links)
• Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← links)
• Mixed covering of trees and the augmentation problem with odd diameter constraints (Q5899375) (← links)
• An improved algorithm for diameter-optimally augmenting paths in a metric space (Q5915544) (← links)
• A linear-time algorithm for radius-optimally augmenting paths in a metric space (Q5918103) (← links)
• Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5970916) (← links)
• Edge-fault diameter of \(C_4\)-free graphs (Q6080136) (← links)
• Algorithms for radius-optimally augmenting trees in a metric space (Q6110070) (← links)
• Augmenting graphs to minimize the radius (Q6114475) (← links)
• On the stability of the principal ratio (Q6149179) (← links)
• Bounds on the fault-diameter of graphs (Q6496348) (← links)