Blog

Problem Detail: The Problem: Let T be a tree constructed by Dijkstra’s algorithm in the process of solving the single source shortest-paths problem for a weighted connected graph G.    a. True of false: T is a spanning tree of G? Read More …

Problem Detail: Let G = (V,E) be a unit-capacity graph with n vertices and m edges. Let T denote all the spanning trees in G. If we run Karger’s algorithm, we will get a random spanning tree in T formed by Read More …

Problem Detail:  Is there some natural or notable way to relate or link math groups and CS formal languages or some other core CS concept e.g. Turing machines? I am looking for references/applications. However note that I am aware of Read More …

Problem Detail: I have to create a roadmap for the quantum computing technology. Looking around I found the timeline on wikipedia that is pretty wide but does not highlight the key events in quantum computing research neither sets the possible future Read More …

Problem Detail: Let $G$ be a graph, and let $s$ and $t$ be two vertices of $G$. Can we efficiently sample a shortest $s$-$t$ path uniformly and independently at random from the set of all shortest paths between $s$ and $t$? Read More …

Problem Detail: What is the definition of a “c-competitive” algorithm? For example what does it mean, if we say that there is a 2-competitive algorithm for packet routing? Asked By : George Ts Answered By : Bartosz Przybylski You are given algorithm $ALG$ Read More …

Problem Detail: I’m currently taking an Algorithms course, and we are covering Backtracking, CSP, and heuristics. However, I’m getting confused on exactly the differences between these terms and their applications. When using Backtracking on a problem, I understand we are calculating Read More …

Problem Detail: Given simple, udirected and connected graph with $n$ verticies. Every edge in this graph has some weight. I have to find (in polynomial time) a set of edges such that : 1.every simple cycle in graph contains at least Read More …

Problem Detail: We know error correcting codes are parameterized as (n,k,d) codes. I wanted to know the values of these parameters for some commonly used error correcting codes in computer memories or in DRAMs, etc. I just wanted to see some Read More …

Problem Detail: I’m just curious about the pseudocode (or real source code, doesn’t matter) of the recursive version of this algorithm. In almost every book chapter/paper when describing this topic, they mention that the recursive version takes exponential time and then Read More …