Pages that link to "Item:Q967311"
From MaRDI portal
The following pages link to Finding the longest isometric cycle in a graph (Q967311):
Displaying 8 items.
- Decomposing a graph into shortest paths with bounded eccentricity (Q777405) (← links)
- On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
- Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
- On the minimum eccentricity isometric cycle problem (Q2132344) (← links)
- Improved bounds on the difference between the Szeged index and the Wiener index of graphs (Q2441954) (← links)
- On Computing the Gromov Hyperbolicity (Q2828207) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- (Q5136231) (← links)
