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

Advanced Engineering Mathematics
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
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
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,
SEE MORE TEXTBOOKS