The following pages link to Unit disk graphs (Q1174134):
Displaying 50 items.
- 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)
- 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)
- A new bound on maximum independent set and minimum connected dominating set in unit disk graphs (Q887860) (← links)
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs (Q906392) (← 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)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← 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)
- Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems (Q1071507) (← 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)
- Impact of locality on location aware unit disk graphs (Q1662429) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775) (← links)
- Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
- The connected disk covering problem (Q1702836) (← links)
- Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
- Routing in unit disk graphs (Q1742368) (← links)
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (Q1742371) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← 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)
- PTAS for the minimum weighted dominating set in growth bounded graphs (Q1928314) (← links)
- Integer realizations of disk and segment graphs (Q1932476) (← links)
- Optimization problems over unit-distance representations of graphs (Q1953430) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference (Q1991274) (← links)
- Sensor network topology design and analysis for efficient data gathering by a mobile mule (Q2006940) (← links)
- The complexity of data aggregation in static and dynamic wireless sensor networks (Q2013589) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
