Pages that link to "Item:Q3439382"
From MaRDI portal
The following pages link to Distance Labeling for Permutation Graphs (Q3439382):
Displaying 6 items.
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs (Q868392) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Distance and connectivity measures in permutation graphs (Q1408867) (← links)
- Succinct permutation graphs (Q2684486) (← links)
- Using Graphs for the Analysis and Construction of Permutation Distance-Preserving Mappings (Q3604519) (← links)
- Graph distance‐dependent labeling related to code assignment in computer networks (Q4667824) (← links)