The following pages link to (Q4414499):
Displaying 6 items.
- Algorithms for graphs with small octopus (Q1421464) (← links)
- A faster diameter problem algorithm for a chordal graph, with a connection to its center problem (Q2659238) (← links)
- The complexity of deciding whether a graph admits an orientation with fixed weak diameter (Q2808534) (← links)
- Minimizing the oriented diameter of a planar graph (Q2851475) (← links)
- Complexity of approximating the oriented diameter of chordal graphs (Q4459604) (← links)
- On the oriented diameter of planar triangulations (Q6645167) (← links)