跳到内容
An O(nm log n) algorithm for maximum network flow 预览资料
关闭预览资料
正在查...

An O(nm log n) algorithm for maximum network flow

著者: Daniel D Sleator
出版商: Stanford, Calif. : Stanford University, Dept. of Computer Science, ©1981.
论文: Ph. D. Stanford University 1980
丛书: Report no. STAN-CS-80-831
版本/格式:   硕士/博士论文 : 硕士论文/博士论文 : 英语查看所有的版本和格式
数据库:WorldCat
评估:

(尚未评估) 0 附有评论 - 争取成为第一个。

主题
更多类似这样的

 

在图书馆查找

&AllPage.SpinnerRetrieving; 正在查找有这资料的图书馆...

详细书目

材料类型: 硕士论文/博士论文
文件类型:
所有的著者/提供者: Daniel D Sleator
OCLC号码: 7815061
描述: [4], v, [2], 75 pages ; 28 cm.
丛书名: Report no. STAN-CS-80-831
责任: by Daniel Dominic Kaplan Sleator.

评论

用户提供的评论
正在获取GoodReads评论...
正在检索DOGObooks的评论

标签

争取是第一个!

相似资料

确认申请

你可能已经申请过这份资料。如果还是想申请,请选确认。

链接数据


Primary Entity

<http://www.worldcat.org/oclc/7815061> # An O(nm log n) algorithm for maximum network flow
    a schema:CreativeWork, bgn:Thesis, schema:Book ;
    bgn:inSupportOf "" ;
    library:oclcnum "7815061" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/21471195#Place/stanford_calif> ; # Stanford, Calif.
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/cau> ;
    schema:about <http://id.worldcat.org/fast/887978> ; # Data structures (Computer science)
    schema:about <http://dewey.info/class/512.5/> ;
    schema:about <http://id.worldcat.org/fast/946584> ; # Graph theory
    schema:copyrightYear "1981" ;
    schema:creator <http://viaf.org/viaf/54241399> ; # Daniel Dominic Sleator
    schema:datePublished "1981" ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/21471195> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/21471195#Series/report_no_stan_cs_80_831> ; # Report no. STAN-CS-80-831
    schema:name "An O(nm log n) algorithm for maximum network flow"@en ;
    schema:productID "7815061" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/7815061#PublicationEvent/stanford_calif_stanford_university_dept_of_computer_science_1981> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/21471195#Agent/stanford_university_dept_of_computer_science> ; # Stanford University, Dept. of Computer Science
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/7815061> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/21471195#Agent/stanford_university_dept_of_computer_science> # Stanford University, Dept. of Computer Science
    a bgn:Agent ;
    schema:name "Stanford University, Dept. of Computer Science" ;
    .

<http://experiment.worldcat.org/entity/work/data/21471195#Place/stanford_calif> # Stanford, Calif.
    a schema:Place ;
    schema:name "Stanford, Calif." ;
    .

<http://experiment.worldcat.org/entity/work/data/21471195#Series/report_no_stan_cs_80_831> # Report no. STAN-CS-80-831
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/7815061> ; # An O(nm log n) algorithm for maximum network flow
    schema:name "Report no. STAN-CS-80-831" ;
    .

<http://id.worldcat.org/fast/887978> # Data structures (Computer science)
    a schema:Intangible ;
    schema:name "Data structures (Computer science)"@en ;
    .

<http://id.worldcat.org/fast/946584> # Graph theory
    a schema:Intangible ;
    schema:name "Graph theory"@en ;
    .

<http://viaf.org/viaf/54241399> # Daniel Dominic Sleator
    a schema:Person ;
    schema:birthDate "1953" ;
    schema:familyName "Sleator" ;
    schema:givenName "Daniel Dominic" ;
    schema:givenName "Daniel D." ;
    schema:name "Daniel Dominic Sleator" ;
    .


Content-negotiable representations

关闭窗口

请登入WorldCat 

没有张号吗?很容易就可以 建立免费的账号.