Dear all:

I am = touching the=20 following problem

Having a graph   G(V1UV2 , E)  in which the degree of all = vertices in=20 V2 is=20 even.

A tourist=20 wants to take a close walk such that:

1:  All vertices in V2 are = visited at least=20 once.

2:  = All=20 vertices in V2 are visited at most = once.

3: The tourist chooses the middle edge to exit = when he=20 visit a vertex from  V2  satisfy in 2 and 3 as most as = possible.

What = is the=20 complexity of the finding this walk?

Is it=20 NP-complete?

An example=20 is attached.

Regards
-----------------------------------------------------
Depar= tment=20 of  Computer Science
Faculty of Math & Computer = Science
Amirkabir=20 University of Technology
424 Hafez Avenue
Tehran 15914
Dear all
Hi
Thank you very much for your registration.
Regards
Hamed Maleki

Hamed Maleki
Physics Department, Faculty of Science,
University of Birjand, Birjand, Iran

Talk is cheap. Use Yahoo! Messenger to make PC-to-Phone calls. Great rates starting at 1¢/min. --0-1802642257-1155269163=:86294-- From h_maaleki@yahoo.com Wed Oct 4 09:32:26 2006 Received: from web56705.mail.re3.yahoo.com (web56705.mail.re3.yahoo.com [66.196.97.64]) by compgeom.poly.edu (8.12.8/8.12.8) with SMTP id k94GWQjd001959 for ; Wed, 4 Oct 2006 09:32:26 -0700 Received: (qmail 72919 invoked by uid 60001); 4 Oct 2006 17:28:12 -0000 DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws; s=s1024; d=yahoo.com; h=Message-ID:Received:Date:From:Subject:To:MIME-Version:Content-Type:Content-Transfer-Encoding; b=p8nKoZxVf5p1EbMXj2RXr52cm6GZVnJ1DdGZ9e+69BTVvIPROX2iMdoVSVcKxTLcJKeaSD6uMSIzNYl9QO9+F45kfuzNv6Kwqh7C6icGTnk1dKUokRstCVK1oa9YxLoxef7Dv8zimzSeX6fYdqwqK1ar8XU+hInlFrUVYZaU4Xg= ; Message-ID: <20061004172812.72917.qmail@web56705.mail.re3.yahoo.com> Received: from [62.60.180.51] by web56705.mail.re3.yahoo.com via HTTP; Wed, 04 Oct 2006 10:28:12 PDT Date: Wed, 4 Oct 2006 10:28:12 -0700 (PDT) From: Hamed Maleki To: compgeom-discuss@compgeom.poly.edu MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="0-1102088984-1159982892=:72376" Content-Transfer-Encoding: 8bit Subject: [Compgeom-discuss] Question abour Linux X-BeenThere: compgeom-discuss@compgeom.poly.edu X-Mailman-Version: 2.1.1 Precedence: list List-Id: Discussions related to computational geometry List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 04 Oct 2006 16:32:27 -0000 --0-1102088984-1159982892=:72376 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Hi all I have 2 question about Linux system operator 1- I am trying to connect to Internet with proxy server with user name and password but i can not. how can i do it? 2- when I use from flash memory, I can not remove and cut off it. How can I do it? regards Hamed Maleki Hamed Maleki Physics Department, Faculty of Science, University of Birjand, Birjand, Iran Home Page: http://hamedmaleki2000.googlepages.com --------------------------------- Do you Yahoo!? Get on board. You're invited to try the new Yahoo! Mail. --0-1102088984-1159982892=:72376 Content-Type: text/html; charset=iso-8859-1 Content-Transfer-Encoding: 8bit
Hi all
I have 2 question about Linux system operator
1-  I am trying to connect to Internet with proxy server with user name and password but i can not. how can i do it?
2- when I use from flash memory, I can not remove and cut off it. How can I do it?
regards
Hamed Maleki

Hamed Maleki
Physics Department, Faculty of Science,
University of Birjand, Birjand, Iran

Do you Yahoo!?
Get on board. You're invited to try the new Yahoo! Mail. --0-1102088984-1159982892=:72376--