From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=0.4 required=5.0 tests=BAYES_00,FORGED_MUA_MOZILLA
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: a07f3367d7,56525db28240414a
X-Google-Attributes: gida07f3367d7,public,usenet
X-Google-NewGroupId: yes
X-Google-Language: ENGLISH,UTF8
Received: by 10.180.24.202 with SMTP id w10mr635368wif.0.1343127645371;
        Tue, 24 Jul 2012 04:00:45 -0700 (PDT)
Received: by 10.66.89.196 with SMTP id bq4mr132385pab.26.1343098182139;
        Mon, 23 Jul 2012 19:49:42 -0700 (PDT)
Path: 
 ge7ni54561875wib.0!nntp.google.com!volia.net!news2.volia.net!feed-B.news.volia.net!u4no14412859pbs.0!news-out.google.com!b9ni44140356pbl.0!nntp.google.com!border1.nntp.dca.giganews.com!border4.nntp.dca.giganews.com!border2.nntp.dca.giganews.com!nntp.giganews.com!ctu-peer!news.nctu.edu.tw!goblin1!goblin2!goblin.stu.neva.ru!news.teledata-fn.de!newsfeed.arcor.de!newsspool4.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Tue, 17 Jul 2012 08:50:00 +0200
From: Georg Bauhaus <rm.dash-bauhaus@futureapps.de>
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.7;
 rv:13.0) Gecko/20120614 Thunderbird/13.0.1
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Efficient Sequential Access to Arrays
References: <01983f1c-f842-4b1f-a180-bcef531dad4c@googlegroups.com>
 <kpltof5a8xvm.arygetd4esmc.dlg@40tude.net>
 <44f2bfd0-75ed-4b9c-982e-61d5308f9c01@googlegroups.com>
 <1s8rnmtyqnrr$.1o78f1qaxeulh$.dlg@40tude.net>
 <e43d83de-d992-475b-bcfc-fafa13c4ea40@googlegroups.com>
 <1lgvwexsx8ovd.xdbvohz8eowp.dlg@40tude.net>
 <4c86d54d-dfeb-44f1-9638-3c416ea51d74@googlegroups.com>
 <iqxu0jiz121b.1i6qo6y7twnvp.dlg@40tude.net>
 <ca3e1b59-5bcc-4359-a6da-8ef3235502af@googlegroups.com>
 <n5f2c468x3m3.11so2phokj0ze$.dlg@40tude.net>
In-Reply-To: <n5f2c468x3m3.11so2phokj0ze$.dlg@40tude.net>
Message-ID: <50050b14$0$6555$9b4e6d93@newsspool4.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 17 Jul 2012 08:49:56 CEST
NNTP-Posting-Host: 3ea6330f.newsspool4.arcor-online.net
X-Trace: 
 DXC=i]dLfMGk?o?gP]QSEBQ^d44IUK<Cl32<14Fo<]lROoR18kF<OcfhCO;?kaliLGR5R0nc\616M64>:Lh>_cHTX3j=bE89iZ1o033
X-Complaints-To: usenet-abuse@arcor.de
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Date: 2012-07-17T08:49:56+02:00
List-Id: <comp.lang.ada>

On 17.07.12 08:31, Dmitry A. Kazakov wrote:
>> >‧ Network connectivity.
> 1. Open amazon site
> 2. Search "netwok adapter"
> 3. Choose 5 different with minimal price
> 4. Among them select one with maximal positive customer reports
> 5. Buy it
>
> (Network connectivity is not an algorithmic problem)
>

Uh, I think it's connected graphs (V, E) here, not computers
and ethernet cables. Or social relations. Just the abstraction.

A search engine result for "network connectivity algorithm":

Abstract:
"This paper surveys the recent progress on the graph algorithms
for solving network connectivity problems such as the extreme
set problem, the cactus representation problem, the edge-connectivity
augmentation problem and the source location problem. In particular,
we show that efficient algorithms for these problems can be designed
based on maximum adjacency orderings."

Keywords: Graph theory, network flow, algorithm, MA ordering,
minimum cut, edge- connectivity, graph augmentation, source
location problem

http://www.orsj.or.jp/~archive/pdf/e_mag/Vol.47_4_199.pdf