Pages that link to "Item:Q1764816"
From MaRDI portal
The following pages link to An exact algorithm for the channel assignment problem (Q1764816):
Displaying 15 items.
- Assigning channels via the meet-in-the-middle approach (Q289931) (← links)
- Distance three labelings of trees (Q415278) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116) (← links)
- Channel assignment via fast zeta transform (Q1944122) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- Labeling planar graphs with a condition at distance two (Q2461777) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- A Theorem about the Channel Assignment Problem (Q4443099) (← links)
- Approximation Algorithms for Minimum Span Channel Assignment Problems (Q5434411) (← links)
- Models and solution techniques for frequency assignment problems (Q5920489) (← links)
