The following pages link to Unit disk graphs (Q1174134):
Displayed 50 items.
- On distance constrained labeling of disk graphs (Q703553) (← 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)
- A combinatorial algorithm for the TDMA message scheduling problem (Q839680) (← links)
- On domination numbers of graphs bundles (Q854408) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- Gridline indifference graphs (Q868216) (← links)
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483) (← links)
- Routing of single-source and multiple-source queries in static sensor networks (Q924537) (← links)
- Coloring the complements of intersection graphs of geometric figures (Q941403) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph (Q1006048) (← links)
- Maximum scan statistics and channel assignment problems in homogeneous wireless networks (Q1019740) (← links)
- Conflict-free coloring of unit disks (Q1028125) (← links)
- Balanced cut approximation in random geometric graphs (Q1029344) (← links)
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks (Q1037372) (← links)
- A better constant-factor approximation for weighted dominating set in unit disk graph (Q1037452) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- Unit disk graphs (Q1174134) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- Path optimization for graph partitioning problems (Q1276954) (← links)
- Domination number of the cross product of paths (Q1293195) (← links)
- Unit disk graph recognition is NP-hard (Q1384186) (← links)
- Graph imperfection. I (Q1850556) (← links)
- The on-line first-fit algorithm for radio frequency assignment problems. (Q1853136) (← links)
- On-line coloring of geometric intersection graphs (Q1862127) (← links)
- Dominating Cartesian products of cycles (Q1891923) (← links)
- Algebraic approach to fasciagraphs and rotagraphs (Q1917348) (← links)
- A tight bound for online colouring of disk graphs (Q2382668) (← links)
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs (Q2456357) (← links)
- OVSF-CDMA code assignment in wireless ad hoc networks (Q2471712) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← links)
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) (← links)
- Sphericity, cubicity, and edge clique covers of graphs (Q2495913) (← links)
- Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs (Q3183486) (← links)
- Improper Colourings of Unit Disk Graphs (Q3439320) (← links)
- Approximation Algorithms for Geometric Intersection Graphs (Q3508563) (← links)
- (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs (Q3511366) (← links)
- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs (Q3602842) (← links)
- ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS (Q3634205) (← links)
- (Q4242579) (← links)
- (Q4698131) (← links)
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs (Q5302070) (← links)
- Covering random points in a unit disk (Q5387075) (← links)
- On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks (Q5445787) (← links)
- Energy-Efficient Dominating Tree Construction in Wireless Ad Hoc and Sensor Networks (Q5445789) (← links)
- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes (Q5458525) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS (Q5696910) (← links)
- A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (Q5696912) (← links)