Kapalı

Advanced Graph Theory and Discrete Mathematics

This is a project consisting of two questions. Each with a few components.

The first involves designing a turing machine (flow chart or table representation) which executes a particular behaviour

The second involves proofs regarding maximum flow and minimum cost in graphs subject to various constraints (not trivially max/flow min cut)

The algorithms in each are examined for efficiency etc

In order to complete this project you need a solid understanding of mathematical proof.

-- send message asking for details and a quick note as to why you feel qualified and I will send the pdf description.

sincerely

^_^ tina

Beceriler: Algoritma, Matematik

Daha fazlasını görün: why graph, understanding algorithms, theory algorithm, representation graphs, representation graph, minimum cut maximum flow, minimum cut graph, minimum cost flow algorithm, minimum cost flow, minimum cost algorithm, min flow, min cost max flow, min cost flow, min cost, maximum flow minimum cut, maximum minimum algorithm, max graph, max flow algorithm, max flow, mathematics for, graph theory algorithm, graphs algorithms, graphs algorithm, graph graphs, flow max

İşveren Hakkında:
( 1 değerlendirme ) London, United Kingdom

Proje NO: #4438686

5 freelancer bu iş için ortalamada 115$ teklif veriyor

sepehrhn

Please check PM. Thanks a lot.

in 3 gün içinde140$ USD
(9 Değerlendirme)
4.2
magkania

I have Masters Degree in Mathematics. My specialization was related to Graph Theory so I am familiar both with graphs and mathematical prooving.

in 3 gün içinde105$ USD
(1 Değerlendirme)
3.4
rsonbol

I can do this,

in 3 gün içinde200$ USD
(2 Değerlendirme)
2.9
Hnnghia

Hello, I can do it. Regards

in 3 gün içinde100$ USD
(1 Değerlendirme)
2.3
akhilturai

Thanks for the invitation,Can you please provide me with the docs.?

in 3 gün içinde30$ USD
(2 Değerlendirme)
1.9