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
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Discrete math
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
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!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
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…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
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…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
