📄 http:^^www.cs.columbia.edu^~galil^galil.algorithms.html
字号:
Date: Wed, 15 Jan 1997 00:11:20 GMT
Server: Apache/1.1.1
Content-type: text/html
Content-length: 1186
Last-modified: Wed, 28 Aug 1996 13:37:05 GMT
<HEAD><TITLE> Algorithms</TITLE></HEAD><BODY><P> <BR><BR> <HR> <P><H2><A NAME=SECTION00081000000000000000> Algorithms</A></H2><P>I am working on designing new sequential and parallel algorithms, andimproving existing ones, to solve various computational problems suchas: graph isomorphism, membership in permutation groups (generalizedRubik's Cube), network flow, matching in graphs, Booleanmatrix multiplication, and connectivity of graphs.<P>Recently, I have been concentrating on the following problems.<P>Dynamic graph algorithms. These are algorithms which solve problems inwhich the input graph keeps changing; e.g. edges are inserted and deleted or weights areincreased or decreased. The goal is to maintain the solution in sucha way that the changes in it can be found faster than resolving theproblem from scratch.<P>String processing algorithms with applications to molecular biology.There exist computational problems associated with the humangenome project where algorithmic improvements are possible. An areawere considerable progress has already been achieved is the speed upof various dynamic programming techniques.<P><BR> <HR></BODY>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -