Let H be a set of at least 3 half-planes. We call a half-plane h redundant if it doesn't contribute an edge to the intersection of all half planes in H. Prove that for any redundant half-plane h E H, there are two other half- planes h', h"E H such that h'nh"contains h. Use this fact to give an algorithm (as fast as possible) to compute all redundant half- planes. required pseudocode please

Let H be a set of at least 3 half-planes. We call a half-plane h redundant if it doesn't contribute an edge to the intersection of all half planes in H. Prove that for any redundant half-plane h E H, there are two other half- planes h', h"E H such that h'nh"contains h. Use this fact to give an algorithm (as fast as possible) to compute all redundant half- planes. required pseudocode please

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Fix two positive integers k and n so that k < n/2. Let G = (X, Y )be the bipartite graph in which the vertices of X are the k-elementsubsets of [n], the vertices of Y are the (k + 1)-element subsets of [n],and there is an edge between x ∈ X and y ∈ Y if and only if x ⊂ y.Prove that X has a perfect matching into Y by 1: using Philip Hall’s theorem,2: finding a perfect matching of X to Y .
Suppose X is a subset of vertices in a G = (V,E). Give a polynomial-time algorithm to test whether there exists a matching in G covering X.
Suppose you are given a connected weighted undirected graph, G, with n vertices and m edges, such that the weight of each edge in G is an integer in the interval [1, c], for a fixed constant c > 0. Show how to solve the single-source shortest-paths problem, for any given vertex v, in G, in time O(n + m). Please don't copy and paste the other answers to this question. I'm posting it because the other answers either don't answer the question or have a complicated way of solving the problem.
An undirected graph G = (V, E) is called “k-colorable” if there exists a way to color the nodes withk colors such that no pair of adjacent nodes are assigned the same color. I.e. G is k-colorable iff there existsa k-coloring χ : V → {1, . . . , k}, such that for all (u, v) ∈ E, χ(u) ̸= χ(v) (the function χ is called a properk-coloring). The “k-colorable problem” is the problem of determining whether an input graph G = (V, E) isk-colorable. Prove that the 3-colorable problem ≤P the 4-colorable problem.
You are given an adjacency list representation of a weighted directed graph G = (V, E) with n vertices, m edges, and no negative cycles. Furthermore, you are given two designated vertices s, t ∈ V and a subset P ⊆ E of the edges are labeled as “premium” edges. Describe a O(mn)-time algorithm to find the shortest path from s to t that uses at most one premium edge (along with any number of non-premium edges).
Prove that there exists a maximum flow f in G, such that the set of edges carrying positive flowis acyclic. In other words, f has the property that for every directed cycle in G made up of edgese1, e2, . . . , ek, at least one of the values f (e1), f (e2), . . . , f (ek) is equal to zero.
Provide an eficient algorithm that given a directed graph G with n vertices and m edges as input, finds the outdegree of each vertex in G. Note that outdegree of a vertex u is the number of edges directed from u to some other vertex v. Discuss the running-time of your algorithm and Provide an algorithm that given a directed graph G with n vertices and m edges as input, nds the indegree of each vertex in G. Note that indegree of a vertex u is the number of edges directed into u from some other vertex v. Discuss the running-time of your algorithm.
ou are given a directed graph G = (V, E) and two vertices s and t. Moreover, each edge of this graph is colored either blue or red. Your goal is to find whether there is at least one path from s to t such that all red edges in this path appear after all blue edges (the path may not contain any blue edges or any red edges, but if it has both types of edges, all red edges should appear after all blue edges). Design and analyze an algorithm for solving this problem in O(n + m) time.
Let G = (V, E) be an edge-weighted undirected multigraph, that is, an undirected graph with weighted edges that may have selfloops and parallel edges. We call an edge e of G futile if either e is a selfloop or if e is not the lightest edge between its two endpoints (equivalently, it is not the lightest edges among parallel edges). Since all futile edges can be considered as red edges in the MST Meta-Algorithm (every futile edge is the heaviest edge in a cycle of length 1 or 2), we can remove all futile edges from G without changing its minimum spanning tree. The operation of simplifying G removes all futile edges. Show that any edge-weighted multigraph with |V | vertices and |E| edges can be simplified in O(|V | + |E|) time. Describe an algorithm for doing so and present data structures used.
There is an undirected graph G = (V = {v1, . . . , vn}, E). There are a total of n! possible orderingsof these vertices. Pick one such ordering uniformly at random σ = (σ1, . . . , σn). Then consider the following process:Begin with S = ∅. Then, at each step (for i = 1 to n), if for all u ∈ S, (u, vσi) ∈/ E, add vσito S.Denote by d the maximum degree of a vertex of V . Prove that the proposed algorithm achieves an independent setwith expected value of at least 1/d fraction of the optimal solution.
Let G be a graph with n vertices. The k-coloring problem is to decide whether the vertices of G can be labeled from the set {1, 2, ..., k} such that for every edge (v,w) in the graph, the labels of v and w are different. Is the (n-4)-coloring problem in P or in NP? Give a formal proof for your answer. A 'Yes' or 'No' answer is not sufficient to get a non-zero mark on this question.
: Prove that for any n green and n red points in a plane such thatno 3 points are on the same line, it is possible to match eachgreen with one red such that no two segments connectingmatched nodes intersect (type the answer please)