Problem Detail: This is a follow-up question of “Not all Red-Black trees are balanced?” and “AVL trees are not weight-balanced?“.$defle{leqslant}defge{geqslant}$ Definition: For a rooted tree $T$ and a vertex $v in V(T)$, let $L_T(v)$ be the number of nodes in the Read More …
Category: Uncategorized
[Solved]: Size of Maximum Matching in Bipartite Graph
Problem Detail: Am I correct in my observation that the cardinality of the maximum matching $M$ of a bipartite graph $G(U, V, E)$ is always equal to $min(|U|, |V|)$? Asked By : ultrajohn Answered By : Nicholas Mancuso Given a bipartite graph $G Read More …
[Solved]: Do Higher Order Functions provide more power to Functional Programming?
Problem Detail: I’ve asked a similar question on cstheory.SE. According to this answer on Stackoverflow there is an algorithm that on a non-lazy pure functional programming language has an $Omega(n log n)$ complexity, while the same algorithm in imperative programming is Read More …
[Solved]: Adjacent house , dynamic programming problem
Problem Detail: I have to be honest this is a homework problem, but I just need to discuss this with some one. The problem is there is a row of n houses, with different profit e.g profit1 for house 1, it Read More …
[Solved]: How to find specificity of a regex match?
Problem Detail: I’m thinking about a routing system. Imagine I have the two following regexes pathpart1/pathpart2 => specific match that routes to controller1 .* => catch-all that routes to controller2 And I let them match on a URL, e.g. ‘pathpart1/pathpart2’. They Read More …
[Solved]: Efficient compression of unlabeled trees
Problem Detail: Consider unlabeled, rooted binary trees. We can compress such trees: whenever there are pointers to subtrees $T$ and $T'$ with $T = T'$ (interpreting $=$ as structural equality), we store (w.l.o.g.) $T$ and replace all pointers to $T'$ with Read More …
[Solved]: Finding the largest 3-clique-free induced subgraph
Problem Detail: Consider this problem: Given an undirected graph $G = (V, E)$, find $G’ = (V’, E’)$ such that: $G’$ is an induced subgraph of $G$ $G’$ has no 3-cliques $|V’|$ is maximal So the least number of vertices must Read More …
[Solved]: Is Green’s the best 16-input sorting network so far?
Problem Detail: Every paper says that Green’s construction is the best 16-input sorting network as for now. But why does Wikipedia says: “Size, lower bound: 53”? I thought “lower bound” meant:”If there exists at least an algorithm that can…”. Am I Read More …
[Solved]: Adapting neural network
Problem Detail: I have on a few occasions trained neural networks (back propagation networks) with some rather complicated data sets (backgammon positions and OCR). When doing this, it seems that a lot of the work involves trying out different configurations of Read More …
[Solved]: What does normalizing with hidden bit really mean?
Problem Detail: I have a question related to representing numbers in base 2 with floating point. For example, if I have such a number $$0.000011 cdot 2^3$$ then is its normalized form this? $$1.1cdot 2^{-2}$$ Generally speaking about normalizing, normalizing with Read More …