Pages that link to "Item:Q1647838"
From MaRDI portal
The following pages link to Computational complexity of distance edge labeling (Q1647838):
Displaying 9 items.
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Facial \(L(2, 1)\)-edge-labelings of trees (Q1671360) (← links)
- Systems of distant representatives (Q1764814) (← links)
- The complexity of \(L(p, q)\)-edge-labelling (Q2154095) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- (Q2798240) (redirect page) (← links)
- Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- The complexity of \(L(p, q)\)-edge-labelling (Q6090539) (← links)