The following pages link to (Q4997758):
Displaying 12 items.
- Minimal on-line labelling (Q845889) (← links)
- The computational complexity of cordial and equitable labelling (Q1567263) (← links)
- Online labeling: algorithms, lower bounds and open questions (Q1625136) (← links)
- Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← links)
- Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions (Q2203352) (← links)
- Algorithms for the multiple label placement problem (Q2432730) (← links)
- Adaptive labeling algorithms for the dynamic assignment problem (Q2783873) (← links)
- On Online Labeling with Polynomially Many Labels (Q2912834) (← links)
- Approximation Algorithms on Consistent Dynamic Map Labeling (Q3188846) (← links)
- Algorithms for Multi-Criteria Boundary Labeling (Q3402364) (← links)
- Efficient Algorithms for the Label Cut Problems (Q5410648) (← links)
- Graph Drawing (Q5711599) (← links)
