| 000 | 01923nam a2200421 i 4500 | ||
|---|---|---|---|
| 001 | ebr10901635 | ||
| 003 | CaPaEBR | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 100419t20102010njua ob 001 0 eng|d | ||
| 020 | _z9780691140612 (hardcover : alk. paper) | ||
| 020 | _z0691140618 (hardcover : alk. paper) | ||
| 020 | _a9781400835355 (e-book) | ||
| 040 |
_aCaPaEBR _beng _erda _epn _cCaPaEBR |
||
| 035 | _a(OCoLC)741250746 | ||
| 050 | 1 | 4 |
_aT57.85 _b.M43 2010eb |
| 082 | 0 | 4 |
_a006.3 _222 |
| 100 | 1 |
_aMesbahi, Mehran, _eauthor. |
|
| 245 | 1 | 0 |
_aGraph theoretic methods in multiagent networks / _cMehran Mesbahi and Magnus Egerstedt. |
| 264 | 1 |
_aPrinceton : _bPrinceton University Press, _c[2010] |
|
| 264 | 4 | _c�2010 | |
| 300 |
_a1 online resource (424 pages) : _billustrations. |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_acomputer _2rdamedia |
||
| 338 |
_aonline resource _2rdacarrier |
||
| 490 | 1 | _aPrinceton series in applied mathematics | |
| 504 | _aIncludes bibliographical references and index. | ||
| 588 | _aDescription based on print version record. | ||
| 590 | _aElectronic reproduction. Palo Alto, Calif. : ebrary, 2014. Available via World Wide Web. Access may be limited to ebrary affiliated libraries. | ||
| 650 | 0 |
_aNetwork analysis (Planning) _xGraphic methods. |
|
| 650 | 0 |
_aMultiagent systems _xMathematical models. |
|
| 655 | 0 | _aElectronic books. | |
| 700 | 1 |
_aEgerstedt, Magnus, _eauthor. |
|
| 776 | 0 | 8 |
_iPrint version: _aMesbahi, Mehran. _tGraph theoretic methods in multiagent networks. _dPrinceton : Princeton University Press, [2010] _hxix, 403 pages ; 25 cm _kPrinceton series in applied mathematics _z9780691140612 _w(OCoLC)ocn466341412 _w(DLC)10901635 |
| 797 | 2 | _aebrary. | |
| 830 | 0 | _aPrinceton series in applied mathematics. | |
| 856 | 4 | 0 |
_uhttp://site.ebrary.com/lib/rucke/Doc?id=10901635 _zAn electronic book accessible through the World Wide Web; click to view |
| 999 |
_c56977 _d56977 |
||