Pages that link to "Item:Q301597"
From MaRDI portal
The following pages link to Data center interconnection networks are not hyperbolic (Q301597):
Displaying 8 items.
- On the hyperbolicity of bipartite graphs and intersection graphs (Q317426) (← links)
- A simple approach for lower-bounding the distortion in any hyperbolic embedding (Q1689928) (← links)
- Fault tolerant supergraphs with automorphisms (Q1720338) (← links)
- Using semidirect products of groups to build classes of interconnection networks (Q2192066) (← links)
- On the combinatorial design of data centre network topologies (Q2402367) (← links)
- On the hyperbolicity constant of circular-arc graphs (Q2420429) (← links)
- Simplified constructions of almost peripheral graphs and improved embeddings into them (Q5023793) (← links)
- Leanness computation: small values and special graph classes (Q6606996) (← links)