# Search Results

Results tagged with Search options user 81369
4 results

In computability and complexity, finding mappings between problems that allow solving one problem using a solution of another one. For reduction in programming language theory (e.g. beta-reduction), see [lambda-calculus] or [term-rewriting].

1answer
The following problem is from my algorithms class: Given a graph $G=(V, E)$, decide whether a partition of $V=(V_1, V_2)$ exists such that $\delta(G(V_1))\ge 2$ and $\delta(G(V_2))\ge 3$, where …
asked May 16 '18 by Mengfan Ma
2answers
The following problem is from my algorithms class: Given a graph $G(V, E)$, a set $C \subseteq V$ is called a biclique iff $G[C]$ is a complete bipartite graph, where $G(C)$ is the subgraph induc …
asked May 16 '18 by Mengfan Ma
The maximum leaf spanning tree(MLSPT) is equivalent to the minimum connected dominating set(MCDS), see here. So we just need to prove MCDS is NP-complete. It's easy to verify that the decision version …
answered May 1 by Mengfan Ma
2answers
I'm trying to prove that $$k\text{-Matching}\le_p k\text{-Disjoint-Triangles}$$ but I was told that the $k\text{-Matching}$ (decide whether a graph has a matching of size $k$ ) can be solve in polynom …
asked May 11 '18 by Mengfan Ma