Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
In deciding whether two graphs are isomorphic or not, one can employ the use of a brute force algorithm. For comparing simple graphs, one only needs to check if a candidate bijective function between the vertices of two graphs is an isomorphism. At worst case, every possible bijective function between the vertices needs to be checked before arriving at a decision (either yes or no). Suppose that the proposed brute force algorithm was implemented on a computer able to verify if a candidate bijective function is an isomorphism in one nanosecond (10-º seconds). At worst case, on this computer, if the algorithm is used on two graphs, each with 18 vertices and the same number of edges, approximately how long will it take the computer to decide if the two graphs are isomorphic or not? Select one: O A. 37.05 days O B. 18 seconds O C. 1778.44 hours O D. 889.29 hours O E. 18 nanoseconds

In deciding whether two graphs are isomorphic or not, one can employ the use of a brute force algorithm. For comparing simple graphs, one only needs to check if a candidate bijective function between the vertices of two graphs is an isomorphism. At worst case, every possible bijective function between the vertices needs to be checked before arriving at a decision (either yes or no). Suppose that the proposed brute force algorithm was implemented on a computer able to verify if a candidate bijective function is an isomorphism in one nanosecond (10-º seconds). At worst case, on this computer, if the algorithm is used on two graphs, each with 18 vertices and the same number of edges, approximately how long will it take the computer to decide if the two graphs are isomorphic or not? Select one: O A. 37.05 days O B. 18 seconds O C. 1778.44 hours O D. 889.29 hours O E. 18 nanoseconds

Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.2: Direct Methods For Solving Linear Systems
Problem 2CEXP
See similar textbooks
icon
Related questions
Question

Discrete math

In deciding whether two graphs are isomorphic or not, one can employ the use of a brute force algorithm. For comparing simple graphs, one only needs to check if a candidate bijective function between the vertices of two graphs is an isomorphism. At worst case, every possible bijective function between the vertices needs to be checked before arriving at a decision (either yes or no). Suppose that the proposed brute force algorithm was implemented on a computer able to verify if a candidate bijective function is an isomorphism in one nanosecond (10-9 seconds). At worst case, on this computer, if the algorithm is used on two graphs, each with 18 vertices and the same number of edges, approximately how long will it take the computer to decide if the two graphs are isomorphic or not? Select one: O A. 37.05 days O B. 18 seconds OC. 1778.44 hours O D. 889.29 hours O E. 18 nanoseconds
Transcribed Image Text:In deciding whether two graphs are isomorphic or not, one can employ the use of a brute force algorithm. For comparing simple graphs, one only needs to check if a candidate bijective function between the vertices of two graphs is an isomorphism. At worst case, every possible bijective function between the vertices needs to be checked before arriving at a decision (either yes or no). Suppose that the proposed brute force algorithm was implemented on a computer able to verify if a candidate bijective function is an isomorphism in one nanosecond (10-9 seconds). At worst case, on this computer, if the algorithm is used on two graphs, each with 18 vertices and the same number of edges, approximately how long will it take the computer to decide if the two graphs are isomorphic or not? Select one: O A. 37.05 days O B. 18 seconds OC. 1778.44 hours O D. 889.29 hours O E. 18 nanoseconds
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
SEE MORE TEXTBOOKS