2. [20 points][MID] The graph k-coloring problem is stated as follows: Given anundirected graph G = (V, E) with N vertices and M edges and an integer k. Assign toeach vertex v in V a color e(r) such that 1 < e{u) < k and c(u) # c(v) for every edge(u, v) in E. In other words you want to color each vertex with one of the k colors youhave and no two adjacent vertices can have the same color.For example, the following graph can be 3-colored using the following color assignments:a=1,b=2,c=1,d%32,e=3,f=2.g33a---b---c---gdFormulate the graph k-coloring problem as an evolutionary optimization. You mayuse a vector of integer representation, OR any representation that you think is moreappropriate. you should specify:• A representation.• itness function. Give 3 examples of individuals and their fitness values if youare solving the above example.A set of mutation and/or crossover and/or repair operators. Intelligent operatorsthat are suitable for this particular domain will earn more credit.• A termination eriterion for the evolutionary optimization which insures that youterminate with a valid solution to the graph k-coloring problem if possiblewithout running indefinitely.

Answer 2) Graph k-coloring problems is defined as in the graph coloring there are no same color in…

2. [20 points][MID] The graph k-coloring problem is stated as follows: Given an undirected graph G= (V, E) with N vertices and M edges and an integer k. Assign to each vertex v in V a color e(r) such that 1< e(r)

2. [20 points][MID] The graph k-coloring problem is stated as follows: Given an undirected graph G= (V, E) with N vertices and M edges and an integer k. Assign to each vertex v in V a color e(r) such that 1< e(r)

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: All of the following statements are false. Provide a counterexample for each one. iii. If it can be…

A: The true statement for the both statements are given below. iii. If it can be shown that there is…

Q: 7. Consider the following graph: B A •C D (a) Write the degree of each vertex (write it next to the…

A: 7 a) Degree of vertex: Degree of a vertex is denoted by the number of the edges that are connecting…

Q: Explain how the edge-coloring problem can be polynomial reduced to a vertex-coloring problem. Give…

A: According to the question , we have to Explain how the edge-coloring problem can be polynomial…

Q: Course : Algorithm Show two possible solutions for the m-coloring problem to find all possible…

A: Actually, algorithm is an step by step process.

Q: Graph Data Structure is made up of nodes and edges. (A Tree Data Structure is a special kind of a ph…

A: based on data structures

Q: 5. Icosian Game A century after Euler's discovery (see Problem 4), another famous puzzle–this one…

Q: You will create an implementation of this algorithm. Your driver program should provide a graph and…

A: Actually, algorithm is an step by step process.

Q: Programming with Python: v Implement Depth First Search (Traversal) v Implement Breadth First…

A: Depth First Search(DFS): DFS is the graph traversal algorithm. It uses a stack to implement. It is…

Q: a. Write down the degree of the 16 vertices in the graph below: 14 11 13 12 15 7 10 16

A: A graph can be directed or undirected. A graph in which each vertex is associated with incoming and…

Q: Given a directed graph. The task is to find a shortest path from vertex 0 to a target vertex v. You…

A: The answer given as below:

Q: a d b a) Give the vertex set of the G. b) Give the set of edge of G. c) Find the degree of each of…

A: In this question we have been given with the graph and we have to answer for the graph theory…

Q: In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels…

A: -Vertex coloring is the most common graph coloring problem. -The basic algorithm never uses more…

Q: Is it true or false? If it is true, include a (short, but clear) argument why it is true, and if it…

A: Given four statements and we need to find out if they are true or false.

Q: 5. Vertices: (a, b, c, d, e, f. g} Edges: {{a,b). {a, f). (b, e). (b. g). (c. f). {c. g). (c. d).…

A: vertices {a,b,c,d,e,f,g} edes given draw graph and find adjacent vertices of vertex c find shortest…

Q: Recall the complete bipartite graph Km.n. a) Draw K5,3. b) Determine the number of vertices in Km.n…

A: The above question is solved in step 2 :-

Q: P2: (15 pts) Given the below directed graph, apply the 4-step algorithm to determine thegraph’s…

A: The objective of the question is to determine the strongly connected components of a given directed…

Q: The Douglas-Peucker algorithm is for the selection of representative points to simplify a curve…

A: At first, the improvement comprises of a solitary edge. During the initial step, the fourth vertex…

Question

2. [20 points][MID] The graph k-coloring problem is stated as follows: Given an
undirected graph G = (V, E) with N vertices and M edges and an integer k. Assign to
each vertex v in V a color e(r) such that 1 < e{u) < k and c(u) # c(v) for every edge
(u, v) in E. In other words you want to color each vertex with one of the k colors you
have and no two adjacent vertices can have the same color.
For example, the following graph can be 3-colored using the following color assignments:
a=1,b=2,c=1,d%32,e=3,f=2.g33
a---b---c---g
d
Formulate the graph k-coloring problem as an evolutionary optimization. You may
use a vector of integer representation, OR any representation that you think is more
appropriate. you should specify:
• A representation.
• itness function. Give 3 examples of individuals and their fitness values if you
are solving the above example.
A set of mutation and/or crossover and/or repair operators. Intelligent operators
that are suitable for this particular domain will earn more credit.
• A termination eriterion for the evolutionary optimization which insures that you
terminate with a valid solution to the graph k-coloring problem if possible
without running indefinitely.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

*Discrete Math In the graph above, let ε = {2, 3}, Let G−ε be the graph that is obtained from G by deleting the edge {2,3}. Let G∗ be the graph that is obtain from G − ε by merging 2 and 3 into a single vertex w. (As in the notes, v is adjacent to w in the new if and only if either {2,v} or {3,v is an edge of G.) (a) Draw G − ε and calculate its chromatic polynomial. (b) Give an example of a vertex coloring that is proper for G − ε, but not for G. (c) Explain, in own words, why no coloring can be proper for G but not proper for G − ε. (d) Draw G∗ and calculate its chromatic polynomial. (e) Verify that, for this example,PG(k) = PG−ε(k) − PG∗ (k).
One can manually count path lengths in a graph using adjacency matrices. Using the simple example below, produces the following adjacency matrix: A B A 1 1 B 1 0 This matrix means that given two vertices A and B in the graph above, there is a connection from A back to itself, and a two-way connection from A to B. To count the number of paths of length one, or direct connections in the graph, all one must do is count the number of 1s in the graph, three in this case, represented in letter notation as AA, AB, and BA. AA means that the connection starts and ends at A, AB means it starts at A and ends at B, and so on. However, counting the number of two-hop paths is a little more involved. The possibilities are AAA, ABA, and BAB, AAB, and BAA, making a total of five 2-hop paths. The 3-hop paths starting from A would be AAAA, AAAB, AABA, ABAA, and ABAB. Starting from B, the 3-hop paths are BAAA, BAAB, and BABA. Altogether, that would be eight 3-hop paths within this graph. Write a program…
1. Unreachable Nodes You have been given an undirected graph consisting of N nodes and Medges. The nodes in this graph are enumerated from 1 to N. The graph can consist of self-loops as well as multiple edges. This graph consists of a special node called the head node. You need to consider this and the entry point of this graph. You need to find the number of nodes that are unreachable from this head node. Create a function unreachableNodesCount (N, M, ListofEdges, HeadNode) where N is the number of nodes, M is the number of edges, List0fEdges contains list of edges in the graph and HeadNode is a special node which is the entry point of this graph. The function will return the number of nodes that are unreachable from the head node. Note: You will need to use N, M and List of Edges to first create the graph, as well as a search function to define the unreachable nodes count. >>>N = 10 >>> M = 10 >>> ListofEdges [(8, 1), (8, 3), (7, 4), (7, 5), (2, 6), (10, 7), (2, 8), (10, 9), (2, 10),…
A B. D H Suppose you run the topological sort algorithm on the graph above starting at vertex C. Use the rule that when there is a choice of vertices for the algorithm to visit, it visits them in alphabetic order. Which vertex would end up first in the eventual topologically sorted order? Which would end up being second? Which would end up being third? Which would end up being fourth? Which would end up being fifth? Which would end up being sixth?
3. Kleinberg, Jon. Algorithm Design (p. 519, q. 28) Consider this version of the Independent Set Problem. You are given an undirected graph G and an integer k. We will call a set of nodes I "strongly independent" if, for any two nodes v, u € I, the edge (v, u) is not present in G, and neither is there a path of two edges from u to v. That is, there is no node w such that both (v, w) and (u, w) are present. The Strongly Independent Set problem is to decide whether G has a strongly independent set of size at least k. Show that the Strongly Independent Set Problem is NP-Complete.
5. (This question goes slightly beyond what was covered in the lectures, but you can solve it by combining algorithms that we have described.) A directed graph is said to be strongly connected if every vertex is reachable from every other vertex; i.e., for every pair of vertices u, v, there is a directed path from u to v and a directed path from v to u. A strong component of a graph is then a maximal subgraph that is strongly connected. That is all vertices in a strong component can reach each other, and any other vertex in the directed graph either cannot reach the strong component or cannot be reached from the component. (Note that we are considering directed graphs, so for a pair of vertices u and v there could be a path from u to v, but no path path from v back to u; in that case, u and v are not in the same strong component, even though they are connected by a path in one direction.) Given a vertex v in a directed graph D, design an algorithm for com- puting the strong connected…
1. This question is about type of graphs. a. Construct a graph with exactly 5 nodes such that the graph is strongly connected. b. Construct a graph with exactly 5 nodes such that the graph is weakly connected. c. Construct a graph with exactly 5 nodes such that the graph is completely connected. d. Construct a graph with exactly 5 nodes such that the graph is not connected. e. Construct a graph with exactly 5 nodes such that the graph is not a simple graph.
Give an example of a graph that has all 3 of the following properties. (Note that you need to give a single graph as the answer.) (i) It is connected (ii) It has one articulation point. (iii) The graph needs at least 4 colors for a valid vertex coloring (iv) The graph does not have a 4-clique (that is, a clique of 4 vertices) as a subgraph.