Pages that link to "Item:Q4307057"
From MaRDI portal
The following pages link to Routing Permutations on Graphs via Matchings (Q4307057):
Displayed 17 items.
- A tight upper bound on acquaintance time of graphs (Q343701) (← links)
- A note on the acquaintance time of random graphs (Q396895) (← links)
- Extremal permutations in routing cycles (Q727043) (← links)
- The spectra of multiplicative attribute graphs (Q741499) (← links)
- Many-to-many routing on trees via matchings (Q1390958) (← links)
- On-line matching routing on trees (Q1575846) (← links)
- Routing by matching on convex pieces of grid graphs (Q2123294) (← links)
- The acquaintance time of (percolated) random geometric graphs (Q2346592) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- Collision-free network exploration (Q2396820) (← links)
- Acquaintance Time of Random Graphs Near Connectivity Threshold (Q2801332) (← links)
- Optimal permutation routing for low-dimensional hypercubes (Q3057142) (← links)
- The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant (Q4622770) (← links)
- Routing on trees via matchings (Q5057438) (← links)
- A Sorting Network on Trees (Q5087857) (← links)
- (Q5089148) (← links)
- ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES (Q5249268) (← links)