跳至内容
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 

没有帳號嗎?你可很容易的 建立免費的帳號.