Pages that link to "Item:Q1384186"
From MaRDI portal
The following pages link to Unit disk graph recognition is NP-hard (Q1384186):
Displaying 50 items.
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- Sphere and dot product representations of graphs (Q411410) (← links)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- On the recognition of unit disk graphs and the distance geometry problem with ranges (Q499355) (← links)
- A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks (Q512868) (← links)
- Location-oblivious distributed unit disk graph coloring (Q534767) (← links)
- On connected domination in unit ball graphs (Q537633) (← links)
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← 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 distance constrained labeling of disk graphs (Q703553) (← links)
- On forbidden induced subgraphs for unit disk graphs (Q724944) (← links)
- Strong chromatic index of \(K_{1, t}\)-free graphs (Q777360) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- On the reconstruction of three-dimensional protein structures from contact maps (Q1662462) (← links)
- Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- Research on gateway deployment of WMN based on maximum coupling subgraph and PSO algorithm (Q1701611) (← links)
- Implicit representation conjecture for semi-algebraic graphs (Q1735676) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- On-line coloring of geometric intersection graphs (Q1862127) (← links)
- PTAS for the minimum weighted dominating set in growth bounded graphs (Q1928314) (← links)
- Dilation coefficient, plane-width, and resolution coefficient of graphs (Q1950340) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- Unit disk representations of embedded trees, outerplanar and multi-legged graphs (Q2151453) (← links)
- Arrangements of orthogonal circles with many intersections (Q2151458) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Complexity of edge monitoring on some graph classes (Q2172388) (← links)
- Computing stable Demers cartograms (Q2206829) (← links)
- On arrangements of orthogonal circles (Q2206852) (← links)
- Deployment optimization of multi-hop wireless networks based on substitution graph (Q2293167) (← links)
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
- Minimum bisection is NP-hard on unit disk graphs (Q2407090) (← links)
- Efficient sub-5 approximations for minimum dominating sets in unit disk graphs (Q2453164) (← links)
- Sphericity, cubicity, and edge clique covers of graphs (Q2495913) (← links)
- The number of disk graphs (Q2509768) (← links)
- Monotone maps, sphericity and bounded second eigenvalue (Q2573647) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- Unit ball graphs on geodesic spaces (Q2657071) (← links)
- Distinguishing graphs via cycles (Q2695304) (← links)
- Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
- Testing for high-dimensional geometry in random graphs (Q2830237) (← links)
- Low Ply Drawings of Trees (Q2961519) (← links)
