Drawing Graphs on Few Lines and Few Planes
Transcript of Drawing Graphs on Few Lines and Few Planes
![Page 1: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/1.jpg)
The Complexity of Drawing Graphs
on Few Lines and Few Planes
Steven Chaplick Krzysztof FleszarFabian Lipp Alexander Wolff
Julius-Maximilians-Universitat Wurzburg, Germany
Alexander RavskyNational Academy of Sciences of Ukraine, Lviv, Ukraine
Oleg VerbitskyHumboldt-Universitat zu Berlin, Germany
![Page 2: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/2.jpg)
Our Task
For any planar graph (like K4) there is a crossing-freestraight-line drawing in the plane.
![Page 3: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/3.jpg)
Our Task
For any planar graph (like K4) there is a crossing-freestraight-line drawing in the plane.
But what about beyond-planar graphs?
![Page 4: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/4.jpg)
Our Task
For any planar graph (like K4) there is a crossing-freestraight-line drawing in the plane.
But what about beyond-planar graphs?Use more than one plane to draw it.
![Page 5: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/5.jpg)
Our Task
For any planar graph (like K4) there is a crossing-freestraight-line drawing in the plane.
How many planes in 3-space do we need to cover all verticesand edges of a crossing-free straight-line drawing of K5?
But what about beyond-planar graphs?Use more than one plane to draw it.
![Page 6: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/6.jpg)
Our Task
For any planar graph (like K4) there is a crossing-freestraight-line drawing in the plane.
How many planes in 3-space do we need to cover all verticesand edges of a crossing-free straight-line drawing of K5?
But what about beyond-planar graphs?Use more than one plane to draw it.
![Page 7: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/7.jpg)
Our Task
For any planar graph (like K4) there is a crossing-freestraight-line drawing in the plane.
How many planes in 3-space do we need to cover all verticesand edges of a crossing-free straight-line drawing of K5?
But what about beyond-planar graphs?Use more than one plane to draw it.
![Page 8: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/8.jpg)
Our Task
For any planar graph (like K4) there is a crossing-freestraight-line drawing in the plane.
How many planes in 3-space do we need to cover all verticesand edges of a crossing-free straight-line drawing of K5? 3
But what about beyond-planar graphs?Use more than one plane to draw it.
![Page 9: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/9.jpg)
Our Task
For any planar graph (like K4) there is a crossing-freestraight-line drawing in the plane.
How many planes in 3-space do we need to cover all verticesand edges of a crossing-free straight-line drawing of K5?
We propose the numberof planes needed as aparameter for classifyingbeyond-planar graphs.
3
But what about beyond-planar graphs?Use more than one plane to draw it.
![Page 10: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/10.jpg)
Related Work: Low Visual Complexity
Minimum number of segments[Durocher et al., JGAA 2013]
![Page 11: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/11.jpg)
Related Work: Low Visual Complexity
Minimum number of segments[Durocher et al., JGAA 2013]
9 segments5 lines
![Page 12: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/12.jpg)
Related Work: Low Visual Complexity
Minimum number of segments[Durocher et al., JGAA 2013]
9 segments5 lines
Low number of arcs[Schulz, JGAA 2015]
![Page 13: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/13.jpg)
Related Work: Low Visual Complexity
Minimum number of segments[Durocher et al., JGAA 2013]
9 segments5 lines
Low number of arcs[Schulz, JGAA 2015]
dodecaedron
![Page 14: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/14.jpg)
Related Work: Low Visual Complexity
Minimum number of segments[Durocher et al., JGAA 2013]
9 segments5 lines
Low number of arcs
10 arcs
[Schulz, JGAA 2015]
dodecaedron
![Page 15: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/15.jpg)
Definitions
Let G be a graph and 1 ≤ m < d .
Affine cover number ρmd (G ):
minimum number of m-dimensional hyperplanes in Rd s.t.G has a crossing-free straight-line drawing that is containedin these planes
![Page 16: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/16.jpg)
Definitions
Let G be a graph and 1 ≤ m < d .
Interesting cases:
• Line cover numbers in 2D and 3D: ρ12, ρ13• Plane cover numbers: ρ23
Affine cover number ρmd (G ):
minimum number of m-dimensional hyperplanes in Rd s.t.G has a crossing-free straight-line drawing that is containedin these planes
![Page 17: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/17.jpg)
Definitions
Let G be a graph and 1 ≤ m < d .
Interesting cases:
• Line cover numbers in 2D and 3D: ρ12, ρ13• Plane cover numbers: ρ23
Affine cover number ρmd (G ):
minimum number of m-dimensional hyperplanes in Rd s.t.G has a crossing-free straight-line drawing that is containedin these planes
• Combinatorial bounds for various classes of graphs• Relations to other graph characteristics
[Chaplick et al., GD 2016]
Known results:
![Page 18: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/18.jpg)
Our Results
• Computing line cover numbers is ∃R-hard(ρ12 and ρ13)
• Computing line cover numbers is fixed-parameter tractable(ρ12 and ρ13)
• Computing plane cover numbers is NP-hard(ρ23)
![Page 19: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/19.jpg)
Our Results
• Computing line cover numbers is ∃R-hard(ρ12 and ρ13)
• Computing line cover numbers is fixed-parameter tractable(ρ12 and ρ13)
• Computing plane cover numbers is NP-hard(ρ23)
![Page 20: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/20.jpg)
∃R-hardness
Decision problem for the existential theory of the reals:decide if first-order formula about the reals of the form∃x1 . . . ∃xmΦ(x1, . . . , xm) is true where formula Φ uses:• no quantifiers• constants 0, 1• basic arithmetic operations• order and equality relations
![Page 21: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/21.jpg)
∃R-hardness
Decision problem for the existential theory of the reals:decide if first-order formula about the reals of the form∃x1 . . . ∃xmΦ(x1, . . . , xm) is true where formula Φ uses:• no quantifiers• constants 0, 1• basic arithmetic operations• order and equality relations
∃R: problems that can be reduced to that problem[Schaefer, GD 2009]
![Page 22: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/22.jpg)
∃R-hardness
Decision problem for the existential theory of the reals:decide if first-order formula about the reals of the form∃x1 . . . ∃xmΦ(x1, . . . , xm) is true where formula Φ uses:• no quantifiers• constants 0, 1• basic arithmetic operations• order and equality relations
∃R: problems that can be reduced to that problem[Schaefer, GD 2009]
∃R
PSPACE
NP
![Page 23: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/23.jpg)
∃R-hardness
Decision problem for the existential theory of the reals:decide if first-order formula about the reals of the form∃x1 . . . ∃xmΦ(x1, . . . , xm) is true where formula Φ uses:• no quantifiers• constants 0, 1• basic arithmetic operations• order and equality relations
∃R: problems that can be reduced to that problem
Natural ∃R-complete problems:• rectilinear crossing number• recognition of segment intersection graphs• recognition of unit disk graphs
[Schaefer, GD 2009]
∃R
PSPACE
NP
![Page 24: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/24.jpg)
Arrangement Graph Recognition (AGR)
Simple line arrangement: set of ` lines in R2
![Page 25: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/25.jpg)
Arrangement Graph Recognition (AGR)
Simple line arrangement: set of ` lines in R2
![Page 26: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/26.jpg)
Arrangement Graph Recognition (AGR)
Simple line arrangement: set of ` lines in R2
• Each pair of lines has exactly one intersection• No three lines share a common point
![Page 27: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/27.jpg)
Arrangement Graph Recognition (AGR)
Simple line arrangement: set of ` lines in R2
• Each pair of lines has exactly one intersection• No three lines share a common point
Arrangement graph:`(`− 1)/2 vertices`(`− 2) edges
![Page 28: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/28.jpg)
Arrangement Graph Recognition (AGR)
Simple line arrangement: set of ` lines in R2
• Each pair of lines has exactly one intersection• No three lines share a common point
Arrangement graph:`(`− 1)/2 vertices`(`− 2) edges
![Page 29: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/29.jpg)
Arrangement Graph Recognition (AGR)
Simple line arrangement: set of ` lines in R2
• Each pair of lines has exactly one intersection• No three lines share a common point
Arrangement graph:`(`− 1)/2 vertices`(`− 2) edges
Problem AGR: Given a graph G = (V , E ), decide if it is anarrangement graph of some set of lines.
![Page 30: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/30.jpg)
Arrangement Graph Recognition (AGR)
Simple line arrangement: set of ` lines in R2
• Each pair of lines has exactly one intersection• No three lines share a common point
Arrangement graph:`(`− 1)/2 vertices`(`− 2) edges
Problem AGR: Given a graph G = (V , E ), decide if it is anarrangement graph of some set of lines.
AGR is known to be ∃R-hard
![Page 31: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/31.jpg)
Line Cover Number is ∃R-hard
Reduction from AGRGiven a graph G = (V , E ).
![Page 32: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/32.jpg)
Line Cover Number is ∃R-hard
Add tails ⇒ G ′: all vertices have degree 1 or 4.
Reduction from AGRGiven a graph G = (V , E ).
![Page 33: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/33.jpg)
Line Cover Number is ∃R-hard
Add tails ⇒ G ′: all vertices have degree 1 or 4.
Reduction from AGRGiven a graph G = (V , E ).
G is an arrangement graph iff ρ12(G ′) ≤ `Claim:
[Durocher, Mondal, Nishat, Whitesides, JGAA 2013]Proof similar to hardness proof for segment number.
Theorem: Deciding whether ρ12(G ) ≤ k and ρ13(G ) ≤ k is∃R-complete.
![Page 34: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/34.jpg)
Our Results
• Computing line cover numbers is ∃R-hard(ρ12 and ρ13)
• Computing line cover numbers is fixed-parameter tractable(ρ12 and ρ13)
• Computing plane cover numbers is NP-hard(ρ23)
![Page 35: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/35.jpg)
Fixed-parameter Tractability
Kernelization:
Assume that G has a k-line cover.Remove connected components that are paths.Contract long paths to at most
(k2
)vertices.
Reduce G to an instance G ′
with size bounded by f (k)
![Page 36: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/36.jpg)
Fixed-parameter Tractability
Kernelization:
Assume that G has a k-line cover.Remove connected components that are paths.Contract long paths to at most
(k2
)vertices.
at most(k2
)intersections
Reduce G to an instance G ′
with size bounded by f (k)
![Page 37: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/37.jpg)
Fixed-parameter Tractability
Kernelization:
Assume that G has a k-line cover.Remove connected components that are paths.Contract long paths to at most
(k2
)vertices.
at most(k2
)intersections
Reduce G to an instance G ′
with size bounded by f (k)
![Page 38: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/38.jpg)
Fixed-parameter Tractability
Kernelization:
Assume that G has a k-line cover.Remove connected components that are paths.Contract long paths to at most
(k2
)vertices.
degree 2degree > 2
degree 1
at most(k2
)intersections
Reduce G to an instance G ′
with size bounded by f (k)
![Page 39: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/39.jpg)
Fixed-parameter Tractability
Kernelization:
Assume that G has a k-line cover.Remove connected components that are paths.Contract long paths to at most
(k2
)vertices.
Number of paths: O(k2)Vertices per path: at most
(k2
)
degree 2degree > 2
degree 1
at most(k2
)intersections
Reduce G to an instance G ′
with size bounded by f (k)
![Page 40: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/40.jpg)
Fixed-parameter Tractability
Kernelization:
Assume that G has a k-line cover.Remove connected components that are paths.Contract long paths to at most
(k2
)vertices.
Number of paths: O(k2)Vertices per path: at most
(k2
)
degree 2degree > 2
}O(k4) vertices
O(k4) edges
degree 1
at most(k2
)intersections
Reduce G to an instance G ′
with size bounded by f (k)
![Page 41: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/41.jpg)
Fixed-parameter Tractability
Test line cover number for reduced graph G ′ of size O(k4).Describe as a formula Φ in the existential theory of the realsand use Renegar’s decision algorithm.
![Page 42: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/42.jpg)
Fixed-parameter Tractability
Test line cover number for reduced graph G ′ of size O(k4).Describe as a formula Φ in the existential theory of the realsand use Renegar’s decision algorithm.
For graph G and integer k, in time2O(k3) + O(n + m) we can decide• whether ρ1d(G ) ≤ k and, if so,• give a combinatorial description
of the drawing.
Theorem:
![Page 43: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/43.jpg)
Our Results
• Computing line cover numbers is ∃R-hard(ρ12 and ρ13)
• Computing line cover numbers is fixed-parameter tractable(ρ12 and ρ13)
• Computing plane cover numbers is NP-hard(ρ23)
![Page 44: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/44.jpg)
Detour: 3-SAT Variant
(x1, x2, x6) (x1, x4, x5) (x1, x3, x4) (x3, x5, x6) (x2, x3, x6)
We use a reduction from Positive Planar Cycle 1-in-3-SAT
![Page 45: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/45.jpg)
Detour: 3-SAT Variant
(x1, x2, x6) (x1, x4, x5) (x1, x3, x4) (x3, x5, x6) (x2, x3, x6)
We use a reduction from Positive Planar Cycle 1-in-3-SAT
![Page 46: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/46.jpg)
Detour: 3-SAT Variant
(x1, x2, x6) (x1, x4, x5) (x1, x3, x4) (x3, x5, x6) (x2, x3, x6)
We use a reduction from Positive Planar Cycle 1-in-3-SAT
![Page 47: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/47.jpg)
Detour: 3-SAT Variant
(x1, x2, x6) (x1, x4, x5) (x1, x3, x4) (x3, x5, x6) (x2, x3, x6)
x1
x2x3
x4
x5x6
We use a reduction from Positive Planar Cycle 1-in-3-SAT
![Page 48: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/48.jpg)
Detour: 3-SAT Variant
(x1, x2, x6) (x1, x4, x5) (x1, x3, x4) (x3, x5, x6) (x2, x3, x6)
x1
x2x3
x4
x5x6
We use a reduction from Positive Planar Cycle 1-in-3-SAT
![Page 49: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/49.jpg)
Detour: 3-SAT Variant
(x1, x2, x6) (x1, x4, x5) (x1, x3, x4) (x3, x5, x6) (x2, x3, x6)
x1
x2x3
x4
x5x6
We use a reduction from Positive Planar Cycle 1-in-3-SAT
![Page 50: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/50.jpg)
Detour: 3-SAT Variant
(x1, x2, x6) (x1, x4, x5) (x1, x3, x4) (x3, x5, x6) (x2, x3, x6)
x1
x2x3
x4
x5x6
We use a reduction from Positive Planar Cycle 1-in-3-SAT
NP-hardness proof:
![Page 51: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/51.jpg)
Detour: 3-SAT Variant
(x1, x2, x6) (x1, x4, x5) (x1, x3, x4) (x3, x5, x6) (x2, x3, x6)
x1
x2x3
x4
x5x6
We use a reduction from Positive Planar Cycle 1-in-3-SAT
NP-hardness proof:
⇓Positive Planar Cycle 1-in-3-SAT is NP-hard
combined and modified
Planar Cycle 3-SAT[Kratochvıl, Lubiw, Nesetril, 1991]
Positive Planar 1-in-3-SAT[Mulzer, Rote, 2008]
+
![Page 52: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/52.jpg)
Intersection Line Gadget
intersectionline gadget G
![Page 53: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/53.jpg)
Intersection Line Gadget
Assume that G is embeddedon two planes
intersectionline
intersectionline gadget G
![Page 54: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/54.jpg)
Intersection Line Gadget
Assume that G is embeddedon two planes
intersectionline
⇒ Red vertices are placedon the intersection line
intersectionline gadget G
![Page 55: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/55.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
(x1, x2, x6) (x1, x4, x5) (x1, x3, x4) (x3, x5, x6) (x2, x3, x6)
x1
x2
x3
x4
x5
x6
![Page 56: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/56.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
x1
x2
x3
x4
x5
x6
![Page 57: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/57.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
x1
x2
x3
x4
x5
x6
![Page 58: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/58.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
x1
x2
x3
x4
x5
x6
![Page 59: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/59.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
x1
x2
x3
x4
x5
x6
![Page 60: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/60.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
x1
x2
x3
x4
x5
x6
![Page 61: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/61.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
x1 x3
x4
x5
x6
x2
![Page 62: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/62.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
x3
x4
x5
x6
x1
x2
![Page 63: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/63.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
x3
x4
x5
x6
x2
x1
![Page 64: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/64.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
x4
x5
x6
x2
x1 x3
![Page 65: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/65.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
x5
x6
x2
x1 x3
x4
![Page 66: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/66.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
x6
x2
x1 x3
x4
x5
![Page 67: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/67.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:x2
x1 x3
x4
x5
x6
![Page 68: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/68.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:x2
x1 x3
x4
x5
x6
clauseslie oninter-sectionline
![Page 69: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/69.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:x2
x1 x3
x4
x5
x6
clauseslie oninter-sectionline blue vertices not on
intersection line
![Page 70: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/70.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:x2
x1 x3
x4
x5
x6
clauseslie oninter-sectionline blue vertices not on
intersection lineeach variable onlyon one plane
![Page 71: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/71.jpg)
Reduction to Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:x2
x1 x3
x4
x5
x6
clauseslie oninter-sectionline blue vertices not on
intersection lineeach variable onlyon one plane
caterpillar onone plane
![Page 72: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/72.jpg)
Hardness of the Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
![Page 73: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/73.jpg)
Hardness of the Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
![Page 74: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/74.jpg)
Hardness of the Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
![Page 75: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/75.jpg)
Hardness of the Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
![Page 76: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/76.jpg)
Hardness of the Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
![Page 77: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/77.jpg)
Hardness of the Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
![Page 78: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/78.jpg)
Hardness of the Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
![Page 79: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/79.jpg)
Hardness of the Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
![Page 80: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/80.jpg)
Hardness of the Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Proof:
false
true
![Page 81: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/81.jpg)
Hardness of the Plane Cover Number
Theorem: Deciding ρ23(G ) = 2 is NP-hard.
Corollary: Deciding ρ23(G ) = k is NP-hard for any k ≥ 2.(add more blocking gadgets)
Plane cover number not FPT in k.
Proof:
false
true
![Page 82: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/82.jpg)
Conclusion
• Computing the line cover numbers is hard, butfixed-parameter tractable.Can it be computed efficiently for trees?
![Page 83: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/83.jpg)
Conclusion
• Positive Planar Cycle1-in-3-SAT is NP-hard.
• Computing the plane covernumber is NP-hard andcontained in ∃R.Is it also ∃R-hard?
• Approximation Algorithms?
• Computing the line cover numbers is hard, butfixed-parameter tractable.Can it be computed efficiently for trees?
![Page 84: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/84.jpg)
Conclusion
• Positive Planar Cycle1-in-3-SAT is NP-hard.
• Computing the plane covernumber is NP-hard andcontained in ∃R.Is it also ∃R-hard?
• Approximation Algorithms?
• Computing the line cover numbers is hard, butfixed-parameter tractable.Can it be computed efficiently for trees?
![Page 85: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/85.jpg)
Conclusion
• Positive Planar Cycle1-in-3-SAT is NP-hard.
• Computing the plane covernumber is NP-hard andcontained in ∃R.Is it also ∃R-hard?
• Approximation Algorithms?
• Computing the line cover numbers is hard, butfixed-parameter tractable.Can it be computed efficiently for trees?
![Page 86: Drawing Graphs on Few Lines and Few Planes](https://reader031.fdocuments.in/reader031/viewer/2022012916/61c6d55db261b762df2827a8/html5/thumbnails/86.jpg)
Conclusion
• Positive Planar Cycle1-in-3-SAT is NP-hard.
• Computing the plane covernumber is NP-hard andcontained in ∃R.Is it also ∃R-hard?
• Approximation Algorithms?
• Computing the line cover numbers is hard, butfixed-parameter tractable.Can it be computed efficiently for trees?