The Resource Graphs, dynamic programming, and finite games, by A. Kaufmann; translated [from the French] by Henry C. Sneyd
Graphs, dynamic programming, and finite games, by A. Kaufmann; translated [from the French] by Henry C. Sneyd
Resource Information
The item Graphs, dynamic programming, and finite games, by A. Kaufmann; translated [from the French] by Henry C. Sneyd represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.This item is available to borrow from 1 library branch.
Resource Information
The item Graphs, dynamic programming, and finite games, by A. Kaufmann; translated [from the French] by Henry C. Sneyd represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.
This item is available to borrow from 1 library branch.
- Label
- Graphs, dynamic programming, and finite games
- Title
- Graphs, dynamic programming, and finite games
- Statement of responsibility
- by A. Kaufmann; translated [from the French] by Henry C. Sneyd
- Language
- eng
- Cataloging source
- UkLiU
- http://library.link/vocab/creatorDate
- 1911-
- http://library.link/vocab/creatorName
- Kaufmann, A.
- Index
- no index present
- Literary form
- non fiction
- Series statement
- Mathematics in science and engineering, vol. 36
- http://library.link/vocab/subjectName
-
- Graph theory
- Games of strategy (Mathematics)
- Programming (Mathematics)
- Label
- Graphs, dynamic programming, and finite games, by A. Kaufmann; translated [from the French] by Henry C. Sneyd
- Label
- Graphs, dynamic programming, and finite games, by A. Kaufmann; translated [from the French] by Henry C. Sneyd
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/Graphs-dynamic-programming-and-finite-games-by/Y_1McH2ocHQ/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/Graphs-dynamic-programming-and-finite-games-by/Y_1McH2ocHQ/">Graphs, dynamic programming, and finite games, by A. Kaufmann; translated [from the French] by Henry C. Sneyd</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Graphs, dynamic programming, and finite games, by A. Kaufmann; translated [from the French] by Henry C. Sneyd
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/Graphs-dynamic-programming-and-finite-games-by/Y_1McH2ocHQ/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/Graphs-dynamic-programming-and-finite-games-by/Y_1McH2ocHQ/">Graphs, dynamic programming, and finite games, by A. Kaufmann; translated [from the French] by Henry C. Sneyd</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>