Pages that link to "Item:Q2132367"

The following pages link to Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs (Q2132367):

Displaying 3 items.

• Edge tree spanners (Q2056906) (← links)
• Hardness and efficiency on \(t\)-admissibility for graph operations (Q2231778) (← links)
• Strategies for generating tree spanners: algorithms, heuristics and optimal graph classes (Q2671810) (← links)