Blog

Problem Detail: So, I know that testing if a regular language $R$ is a subset of regular language $S$ is decidable, since we can convert them both to DFAs, compute $R cap bar{S}$, and then test if this language is empty. Read More …

Problem Detail: There may be a large number of algorithms proposed for generating graphs satisfying some common properties (e.g., clustering coefficient, average shortest path length, degree distribution, etc). My question concerns a specific case: I want to generate a few undirected Read More …

Problem Detail: I try to find an approach to the following problem: Given the set of point $S$ and radius $r$, find the center point of circle, such that the circle contains the maximum number of points from the set. The Read More …

Problem Detail: If a graph with $v$ vertices is represented in the form of adjacency matrix . Then, adding a new vertex to the existing graph requires how much time ? Is it $O(v^2)$ or $O(2v)$ . We have the adjacency Read More …

Problem Detail: I am wondering this statement above [the title] is true or not. Here is what I’ve already had : non-recursive means undecidable. I’ve read this Are all infinite languages undecidable? which says: If a Language is undecidable(non-recursive), there must Read More …

Problem Detail: The algorithms for the problem I am working on become more and more complex as I try to improve their performance. They already span several pages with cases and sub-cases, and will probably become even longer. I am worried Read More …

Problem Detail: I have a run-time implementation question regarding the 3-dimensional (unweighted 2-)approximation algorithm below: How can I construct the maximum matching M_r in S_r in linear time in line 8? $X, Y, Z $ are disjoint sets; a matching $M$ Read More …

Problem Detail: What is the reason that almost all computers (besides some DSPs) use byte addressable memory? With byte addressable memory and a 32 bit address you can have 4GB while with word addressable memory you can have 4GB * wordsize. Read More …

Problem Detail: Recently I was asking about the algorithm to solve The Gas Station Problem and I got useful answer. Unfortunately solution with transforming a graph to complete graph and then preparing another one to find the shortest path (as described Read More …

Problem Detail: Given a path down a full binary tree to a node (for example, a sequence of $1$s and $0$s, $0$ representing “go left” and $1$ representing “go right”), how would one find the position of the node in the Read More …