From mboxrd@z Thu Jan 1 00:00:00 1970 Received: from mail4-relais-sop.national.inria.fr (mail4-relais-sop.national.inria.fr [192.134.164.105]) by walapai.inria.fr (8.13.6/8.13.6) with ESMTP id pA8LxSjo020149 for ; Tue, 8 Nov 2011 22:59:28 +0100 X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: ArkBABOluU7Unw4UkWdsb2JhbABEqiEiAQEBAQkLCwcUBCGBeQgCHhIbMQVoPwEEHgWHdJdooBOJLQSmDw X-IronPort-AV: E=Sophos;i="4.69,479,1315173600"; d="scan'208";a="117736209" Received: from avasout08.plus.net ([212.159.14.20]) by mail4-smtp-sop.national.inria.fr with ESMTP; 08 Nov 2011 22:59:23 +0100 Received: from WinEight ([87.113.61.183]) by avasout08.plus.net with smtp id ulzM1h0083xCgLf01lzNFR; Tue, 08 Nov 2011 21:59:23 +0000 X-CM-Score: 0.00 X-CNFS-Analysis: v=2.0 cv=HdCWv148 c=1 sm=1 a=i+AL1T5PbstOedzNewawrw==:17 a=Xub9RBUEA-sA:10 a=kj9zAlcOel0A:10 a=r2vSxAw-AAAA:8 a=uLBk7gAqpI63Odr20rAA:9 a=CjuIK1q_8ugA:10 a=i+AL1T5PbstOedzNewawrw==:117 From: "Jon Harrop" To: "Caml List" Date: Tue, 8 Nov 2011 21:59:21 -0000 Message-ID: <006501cc9e61$ac282470$04786d50$@ffconsultancy.com> MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit X-Mailer: Microsoft Outlook 14.0 Thread-Index: AcyeQQ1zu4Kz8QBHSL+Ri0hTHLY9yg== Content-Language: en-gb Subject: [Caml-list] Dynamic graph algorithms I just stumbled upon the interesting subject of dynamic graph algorithms, those that can incrementally alter their output given small changes to the graph (i.e. adding and removing edges and/or vertices). Topology trees and sparsification are related subjects. I'm wondering if anyone has done any work on this kind of stuff using OCaml? For some reason, there seems to be surprisingly little research on these topics... -- Dr Jon Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com