The following pages link to Unit disk graphs (Q1174134):
Displayed 50 items.
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- Connectivity of soft random geometric graphs over annuli (Q281201) (← links)
- Upper and lower bounds for deterministic broadcast in powerline communication networks (Q324622) (← links)
- Roman domination in subgraphs of grids (Q324726) (← links)
- Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← links)
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← links)
- Shortest hop multipath algorithm for wireless sensor networks (Q418284) (← links)
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs (Q418750) (← links)
- Compact and low delay routing labeling scheme for unit disk graphs (Q419502) (← links)
- A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs (Q437046) (← links)
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
- Conflict-free coloring of points on a line with respect to a set of intervals (Q452451) (← links)
- Note on coloring of double disk graphs (Q475816) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- On the parameterized complexity of the edge monitoring problem (Q509893) (← links)
- Scaling laws for maximum coloring of random geometric graphs (Q516873) (← links)
- On connected domination in unit ball graphs (Q537633) (← links)
- An exact algorithm for minimum CDS with shortest path constraint in wireless networks (Q537641) (← links)
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- The domination numbers of cylindrical grid graphs (Q627140) (← links)
- The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost (Q631767) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- The minimum positional error incurred by any connectivity-based positioning algorithm for mobile wireless systems (Q650928) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- On the chromatic number of random geometric graphs (Q663092) (← links)
- Clustering the wireless ad hoc networks: a distributed learning automata approach (Q666084) (← links)
- An overview of channel assignment methods for multi-radio multi-channel wireless mesh networks (Q666110) (← links)
- Connected dominating sets on dynamic geometric graphs (Q691774) (← links)
- On distance constrained labeling of disk graphs (Q703553) (← links)
- Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488) (← links)
- A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model (Q714763) (← links)
- Cliques in hyperbolic random graphs (Q724237) (← links)
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- The chromatic and clique numbers of random scaled sector graphs (Q817771) (← links)
- On pseudo-disk hypergraphs (Q827317) (← links)
- Minimum ply covering of points with disks and squares (Q827338) (← links)
- CPG graphs: some structural and hardness results (Q827595) (← links)
- The connected domination number of grids (Q831725) (← links)
- Generalized disk graphs (Q832849) (← links)
- Reverse shortest path problem for unit-disk graphs (Q832915) (← links)
- A combinatorial algorithm for the TDMA message scheduling problem (Q839680) (← links)
- On domination numbers of graphs bundles (Q854408) (← links)