Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5710802
DOI10.1007/b104584zbMath1112.68427OpenAlexW4211210842MaRDI QIDQ5710802
Walter Kern, Tim Nieberg, Johann L. Hurink
Publication date: 8 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104584
Related Items (13)
On spectrum sharing games ⋮ Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs ⋮ Impact of locality on location aware unit disk graphs ⋮ Two generalizations of proper coloring: hardness and approximability ⋮ Independent sets in Line of Sight networks ⋮ Finding Large Independent Sets in Line of Sight Networks ⋮ Approximation algorithms for maximum independent set of pseudo-disks ⋮ Shifting strategy for geometric graphs without geometry ⋮ Approximating minimum independent dominating sets in wireless networks ⋮ Improved Algorithm for Maximum Independent Set on Unit Disk Graph ⋮ The number of disk graphs ⋮ Maximum independent and disjoint coverage ⋮ Perfectness and imperfectness of unit disk graphs on triangular lattice points
Uses Software
This page was built for publication: Graph-Theoretic Concepts in Computer Science
