Problem Detail: In the TSP problem, we usually assume a complete graph. If we can only visit each city once, we need a complete graph to ensure that there will be a path from every city to every other city. This Read More …
Blog
[Solved]: The most efficient way of finding/storing neighbourhood info during octree creation
Problem Detail: Currently I have a program which at some point creates an octree and AFTER the creation loops through all the nodes, for every node (O(n2/2)) and thus finds the neighbours, by a brute-force box-box intersection check. Since that is Read More …
[Solved]: Are there hardware lock implementations without test-and-set or swap?
Problem Detail: Locks are usually implemented thru test-and-set and swap machine-level instructions. Are there other implementations that do not use these? Also, can we say that all hardware level solutions to the critical section problem can be categorized into just three, Read More …
[Solved]: How to improve my these specific math skills?
Problem Detail: I am student of CS. Problem is, I feel that I don’t have enough math knowledge to solve mathematical problems. When some programming problems arises which needs some math skills to solve then despite of the fact that I Read More …
[Solved]: Computational complexity of the clique problem
Problem Detail: What is the best known approximation for the computational complexity of the clique problem? Is it accurate to consider it $O(2^n)$? Asked By : loveToCode Answered By : AJed Wikipedia is usually a good starting reference to well-known problems as the Read More …
[Solved]: Combinational Logic Circuits and Theory of Computation
Problem Detail: I’m trying to link Combinational Logic Circuits ( computers based on logical gates only ) with everything I have learned recently in Theory of Computation. I was wondering whether combinational logic circuits can implement computations in the same way Read More …
[Solved]: Finding Kernel in DAG
Problem Detail: Let $G=(V,E)$ be a DAG. A subset $A subseteq V$ is called a kernel if for all $u,v in A$ $uv notin E$ and for all $v in V-A$ there exists an $a in A$ such that $av in Read More …
[Solved]: What does it mean to say that a language is “effectively closed” under an operation?
Problem Detail: I’ve been reading some formal language theory papers, and I’ve come across a term that I don’t understand. The paper will often refer to a set being “effectively closed under intersection” or other operations. What does “effectively” mean here? Read More …
[Solved]: Maximize distance between k nodes in a graph
Problem Detail: I have an undirected unweighted graph $G$ and I want to select $k$ nodes from $G$ such that they are pairwise as far as possible from each other, in terms of geodesic distance. In other words they have to Read More …
[Solved]: Bipartite Graph Game
Problem Detail: So say we have a bipartite graph G=(X,Y,E). Let’s make a game out of it. I go first. I pick a node in X. You go next. You pick a node in Y that is connected by an edge Read More …
