Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference25 articles.
1. Unit disk graph recognition is NP-hard;Breu;Computational Geometry: Theory and Applications,1998
2. Unit disk graphs;Clark;Discrete Mathematics,1990
3. Heuristics for graph coloring;de Werra;Computing Suppl.,1990
4. A decomposition theorem for partially ordered sets;Dilworth;Annals of Mathematics,1950
5. Online channel allocation in FDMA network with reuse constraints;Feder;Information Processing Letters,1998