Pages that link to "Item:Q393134"
From MaRDI portal
The following pages link to Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134):
Displaying 4 items.
- Assigning channels via the meet-in-the-middle approach (Q289931) (← links)
- Exact algorithm for graph homomorphism and locally injective graph homomorphism (Q2446599) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- A Very Fast Algorithm for Simultaneously Performing Connected-Component Labeling and Euler Number Computing (Q4612951) (← links)
