The following pages link to Planar 3DM is NP-complete (Q3745303):
Displaying 50 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
- Weighted restrained domination in subclasses of planar graphs (Q278718) (← links)
- On strongly planar 3SAT (Q328723) (← links)
- On weighted efficient total domination (Q414423) (← links)
- Efficient total domination in digraphs (Q450576) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- On protein structure alignment under distance constraint (Q553356) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 (Q685502) (← links)
- Efficient sets in graphs (Q686251) (← links)
- Balanced connected graph partition (Q831759) (← links)
- The approximability of three-dimensional assignment problems with bottleneck objective (Q845547) (← links)
- Cooperative mobile guards in grids (Q876501) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- On the complexity of partitioning graphs into connected subgraphs (Q1057062) (← links)
- General factors of graphs (Q1085185) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Testing approximate symmetry in the plane is NP-hard (Q1176235) (← links)
- A graph theoretical approach for the yield enhancement of reconfigurable VLSI/WSI arrays (Q1276972) (← links)
- Geometric three-dimensional assignment problems (Q1278259) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- The complexity of broadcasting in planar and decomposable graphs (Q1392535) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Geometric versions of the three-dimensional assignment problem under general norms (Q1751127) (← links)
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs (Q1941700) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- On the computational complexity of finding a sparse Wasserstein barycenter (Q2025065) (← links)
- Rikudo is NP-complete (Q2118858) (← links)
- The complexity of the unit stop number problem and its implications to other related problems (Q2136280) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Perfect Italian domination on planar and regular graphs (Q2197486) (← links)
- Vertex-edge domination in cubic graphs (Q2198396) (← links)
- Popular and clan-popular \(b\)-matchings (Q2250455) (← links)
- Disjoint dominating and 2-dominating sets in graphs (Q2299982) (← links)
- Path puzzles: discrete tomography with a path constraint is hard (Q2308497) (← links)
- Perfect Roman domination in graphs (Q2333784) (← links)
- Dual power assignment optimization and fault tolerance in WSNs (Q2352357) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
- Approximate separable multichoice optimization over monotone systems (Q2673246) (← links)
- Rectangular spiral galaxies are still hard (Q2678258) (← links)
- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813) (← links)
- Minimum Total Node Interference in Wireless Sensor Networks (Q3078449) (← links)