“Daniel P. Sanders”的意思、由来-开放百科全书

词条

Daniel P. Sanders

释义

Select work
References

Daniel P. Sanders is an American mathematician. He is known for his 1996 efficient proof (algorithm) of proving the Four color theorem (with Neil Robertson, Paul Seymour, and Robin Thomas). He used to be a guest professor of the department of computer science at Columbia University.

Sanders received his Ph.D. in algorithms, combinatorics, and optimization from Georgia Tech in 1993 under the guidance of professor Robin Thomas. He was the Graph Theory Resources editor of www.graphtheory.com. Sanders is a quantitative strategist at Renaissance Technologies. He has been on the faculty of the mathematics departments of the Ohio State University and Princeton University.

Select work

On linear recognition of tree-width at most four, DP Sanders - SIAM Journal on Discrete Mathematics, 1996 - link.aip.org
Efficiently four-coloring planar graphs, - gatech.edu [PS], N Robertson, DP Sanders, P Seymour, R Thomas - Proceedings of the twenty-eighth annual ACM symposium on …, 1996 - portal.acm.org

References

[https://web.archive.org/web/20090527055442/http://www1.cs.columbia.edu/~sanders/ Sanders]
{{MathGenealogy|id=22244}}
Four color theorem
Four color theorem Full text

5 : Graph theorists|Georgia Institute of Technology alumni|People from Milledgeville, Georgia|Living people|Year of birth missing (living people)

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。