Pages that link to "Item:Q1145636"
From MaRDI portal
The following pages link to Computing extremal and approximate distances in graphs having unit cost edges (Q1145636):
Displayed 4 items.
- On sparse matrix orderings in interior point methods (Q402236) (← links)
- Finding pseudoperipheral nodes in graphs (Q797999) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph (Q4315432) (← links)