Problem Detail: I heard here that the Hamiltonian cycle problem is polynomial on graphs of bounded treewidth. I am interested in examples/references to different problems which is essentially hard but having polynomial complexity on graphs of bounded treewidth. Asked By : seteropere Read More …
Category: Uncategorized
[Solved]: Finding MST after adding a new vertex
Problem Detail: Let $G=(V,E)$ which is undirected and simple. We also have $T$, an MST of $G$. We add a vertex $v$ to the graph and connect it with weighted edges to some of the vertices. Find a new MST Read More …
[Solved]: Analyzing load balancing schemes to minimize overall execution time
Problem Detail: Suppose that a certain parallel application uses a master-slave design to process a large number of workloads. Each workload takes some number of cycles to complete; the number of cycles any given workload will take is given by a Read More …
[Solved]: PDA with N-Stacks comparison with Turing Machines
Problem Detail: Is it possible to compare PDA having N-Stacks with Turning Machines. Are they equally powerful in this situation? It’s been told that PDA with 2-Stacks is equally powerful to Turning Machine. But what if we add more stacks i.e. Read More …
[Solved]: Is Equational Reasoning an application of Referential Transparency?
Problem Detail: In various discussions of the merits of functional programming, the phrase referential transparency or equational reasoning is often listed. My question is – are these roughly the same thing? (One being the concept, and the second being the process Read More …
[Solved]: Performing Transitive Reduction via neighbourhood and strongly connected components
Problem Detail: I am trying to learn(self-study, not homework) how to perform transitive reduction according to what what Prof. Leskovec explains in section 10.8.6 in Mining Massive Datasets. The book is free to access online. The section is actually talking about Read More …
[Solved]: Is the maximum coverage variant of Vertex Cover also NP-hard?
Problem Detail: In Chapter 3 of “Approximation Algorithms for NP Hard Problems” edited by Prof. Dorit S. Hochbaum, there is such a sentence that “Maximum Coverage Problem is clearly NP-hard, as Set Cover is reducible to it” in p.135. Given a Read More …
[Solved]: Reference request: Category theory as it applies to type systems
Problem Detail: I keep hearing about how one must learn category theory to truly understand programming language theory. So far, I’ve learned a good deal of PL without ever stepping foot into the realm of categories. However, I figured it was Read More …
[Solved]: Structure of a Pumping Lemma proof: contradiction or counterexample?
Problem Detail: This site is full of Pumping Lemma questions, and I do admit I’ve not read them all. I’ve tried some proofs myself and they seem to work, but I can’t find anywhere what is the (general) exact structure of Read More …
[Solved]: Construct a context-free grammar for a given set of words
Problem Detail: I have seen a few years back a nice and simple algorithm that, given a (finite) set of words in some alphabet, builds a context-free grammar for a language including these words and in some sense “natural” (e.g., the Read More …
