Topološko uređenje — разлика између измена
Садржај обрисан Садржај додат
м ispravke |
м Разне исправке |
||
Ред 90:
== Литература ==
{{refbegin|2}}
* {{Cite book |ref= harv|last = Cook | first = Stephen A. | authorlink = Stephen Cook| title = A Taxonomy of Problems with Fast Parallel Algorithms | journal = Information and Control | volume = 64 | issue = 1–3| year = 1985 | pages = 2–22 | doi = 10.1016/S0019-9958(85)80041-3}}.
* {{Cite book |ref= harv|last1 = Cormen | first1 = Thomas H. | author1-link = Thomas H. Cormen| last2 = Leiserson | first2 = Charles E. | author2-link = Charles E. Leiserson | last3 = Rivest | first3 = Ronald L. | author3-link = Ronald L. Rivest| last4 = Stein | first4 = Clifford | author4-link = Clifford Stein | contribution = Section 22.4: Topological sort| edition = 2nd | isbn = 0-262-03293-7| pages = 549–552 | publisher = MIT Press and McGraw-Hill| title = [[Introduction to Algorithms]] | year = 2001}}.▼
▲* {{Cite book |ref= harv|last1 = Cormen | first1 = Thomas H. | author1-link = Thomas H. Cormen| last2 = Leiserson | first2 = Charles E. | author2-link = Charles E. Leiserson | last3 = Rivest | first3 = Ronald L. | author3-link = Ronald L. Rivest| last4 = Stein | first4 = Clifford | author4-link = Clifford Stein | contribution = Section 22.4: Topological sort| edition = 2nd | isbn = 0-262-03293-7| pages = 549–552 | publisher = MIT Press and McGraw-Hill| title = [[Introduction to Algorithms]]
* {{Cite book |ref= harv|last = Jarnagin | first = M. P.| title = Automatic machine methods of testing PERT networks for consistency | year = 1960| series = Technical Memorandum No. K-24/60 | publisher = U. S. Naval Weapons Laboratory| location = Dahlgren, Virginia}}.
* {{Cite book |ref= harv|last = Kahn | first = Arthur B.| title = Topological sorting of large networks | journal = Communications of the ACM| volume = 5 | issue = 11 | year = 1962 | pages = 558–562 | doi = 10.1145/368996.369025}}.
* {{Cite book |ref= harv|last = Tarjan | first = Robert E. | authorlink = Robert Tarjan| title = Edge-disjoint spanning trees and depth-first search | journal = Acta Informatica | volume = 6 | issue = 2 | year = 1976 | pages = 171–185| doi = 10.1007/BF00268499}}.
* {{Cite book |ref= harv|last1 = Vernet | first1 = Oswaldo| last2 = Markenzon | first2 = Lilian | contribution = Hamiltonian problems for reducible flowgraphs| title = Proc. 17th International Conference of the Chilean Computer Science Society (SCCC '97) | year = 1997| pages = 264–267 | doi = 10.1109/SCCC.1997.637099}}.
{{refend}}
| |||