Randomized Algorithms | Set 1 (Introduction and Analysis)
Randomized Algorithms | Set 1 (Introduction and Analysis) - Randomized Algorithms An algorithm that uses random numbers to...
Author
Venkatesan Prabu
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
2834 Articles
C programming – Graph Coloring | Set 2 (Greedy Algorithm)
C programming - Graph Coloring | Set 2 (Greedy Algorithm) - Graph Algorithms - It doesn’t guarantee to use minimum colors,...
Randomized Algorithms | Set 0 (Mathematical Background)
Randomized Algorithms | Set 0 (Mathematical Background)-Randomized Algorithm Conditional probability P(A | B) indicates the...
Cpp Algorithm – Ford-Fulkerson Algorithm for Maximum Flow Problem
C++ Algorithm - Ford-Fulkerson Algorithm for Maximum Flow Problem - Graph Algorithm - Given a graph which represents a flow...
Expected Number of Trials until Success
Expected Number of Trials until Success- Randomized Algorithms If probability of success is p in every trial, then expected...
Java Algorithm – Ford-Fulkerson Algorithm for Maximum Flow Problem
Java Algorithm - Ford-Fulkerson Algorithm for Maximum Flow Problem - Given a graph which represents a flow network where...
Linearity of Expectation
Linearity of Expectation - Randomized Algorithms This post is about mathematical concepts like expectation, linearity of...
Graph Coloring
Graph Coloring - Graph Cycle - Graph coloring problem is to assign colors to certain elements of a graph subject to certain...
Palindrome Partitioning
Palindrome Partitioning - Dynamic Programming a partitioning of the string is a palindrome partitioning if every substring...
Python Programming-Bellman Ford Algorithm
Python programming - bellman - ford - algorithm Given a graph and a source vertex src in graph, find shortest paths from src...
