Experts are full of valuable knowledge and are ready to help with any question. Credentials confirmed by a Fortune 500 verification firm.

Get a Professional Answer

Via email, text message, or notification as you wait on our site. Ask follow up questions if you need to.

100% Satisfaction Guarantee

Rate the answer you receive.

Ask George Sibiya Your Own Question

George Sibiya,

Category: Homework

Satisfied Customers: 62

Experience: Research Scientist at CSIR

94470076

Type Your Homework Question Here...

George Sibiya is online now

FPT (Fixed-Parameter Tractable) algorithms provide us with

Customer Question

FPT (Fixed-Parameter Tractable) algorithms provide us with efficient ways to solve NP-complete problems in practice when some parts of input, called parameters, are relatively small. For instance, the classical NP-complete Vertex Cover problem can be solved by an FPT algorithm running in time O(kn +1.28exp(k)), which can solve Vertex Cover easily for graphs with millions of vertices as long as the size k of vertex cover is at most 200. The aim of this project is to implement FPT algorithms for some graph problems

Submitted: 3 months ago.

Category: Homework

Share this conversation

Customer:replied 3 months ago.

The deadline of the project is on 29/11 HK time, A report should be included to explain the algorithms. As this topic is required to present, I hope that there will be a detailed explanation.

I have attached the pdf already ,My supervisor suggested using C program.actually the project consists of two parts, now is term one , so for this term, it is only required to complete half of the project, together with the report(deadline: 29/11) with no limit of words. As I am not familiar with this topic, so if the program has detailed explanations, it will be better, because I need to present the project on 5/12.

seems yes, and actually the project requirement includes how to apply an experiment to the daily life. Since I have to write a detailed report and present it to the professor, so would you mind giving me a detailed explanation of the algorithm? Because I am really not familiar with this stuff. Thanks.

Customer:replied 2 months ago.

the requirement says "try to implement an experiment" only, so not a must i think

Project description: FPT (Fixed-Parameter Tractable) algorithms provide us with efficient ways to solve NP-complete problems in practice when some parts of input, called parameters, are relatively small. For instance, the classical NP-complete Vertex Cover problem can be solved by an FPT algorithm running in time O(kn +1.28exp(k)), which can solve Vertex Cover easily for graphs with millions of vertices as long as the size k of vertex cover is at most 200. The aim of this project is to implement FPT algorithms for some graph problems and try to use them to solve real-life problems

I think it's time to finish, because I need to print the report and need time to submit. Thanks so much

Customer:replied 2 months ago.

actually I really dont know whether late submission is ok or not, can I submit at least some part of the project report?

Customer:replied 2 months ago.

I have read the report, Thank you so much! Will you still add things on the report? During the presentation day I can attach a new report to the examiner.

Customer:replied 2 months ago.

can you include the C program to me as well please?

Yes the report still lacks the experimental results.

Once done with with the code, I'll run the experiments, complete the remaining parts of the report (which depend on the exp results) and then send everything together.

thanks so much , would you mind giving a detailed explanation of the coding? Such that I am be more familiar with it and can present to the marker more confidently.