<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://algorist.com/algowiki_v2/index.php?action=history&amp;feed=atom&amp;title=TADM2E_9.7</id>
		<title>TADM2E 9.7 - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://algorist.com/algowiki_v2/index.php?action=history&amp;feed=atom&amp;title=TADM2E_9.7"/>
		<link rel="alternate" type="text/html" href="https://algorist.com/algowiki_v2/index.php?title=TADM2E_9.7&amp;action=history"/>
		<updated>2026-04-30T22:51:00Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.28.0</generator>

	<entry>
		<id>https://algorist.com/algowiki_v2/index.php?title=TADM2E_9.7&amp;diff=203&amp;oldid=prev</id>
		<title>Algowikiadmin: Recovering wiki</title>
		<link rel="alternate" type="text/html" href="https://algorist.com/algowiki_v2/index.php?title=TADM2E_9.7&amp;diff=203&amp;oldid=prev"/>
				<updated>2014-09-11T18:24:26Z</updated>
		
		<summary type="html">&lt;p&gt;Recovering wiki&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Construct an instance of the given problem from vertex cover as follows: &lt;br /&gt;
Create a set of edges for each vertex, u, where the set contains all the edges that have one vertex in u.&lt;br /&gt;
&lt;br /&gt;
Let the large set, X, be the set of all the edges in the graph.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Proofs up to you.&lt;/div&gt;</summary>
		<author><name>Algowikiadmin</name></author>	</entry>

	</feed>