| Tag |
In 1 |
In 2 |
Data |
| 001 | | | vtls000022303 |
| 003 | | | IISER-K |
| 005 | | | 20140514173100.0 |
| 006 | | | m e d |
| 007 | | | cr bn |||m|||a |
| 008 | | | 120213s1983 paua ob 000 0 eng d |
| 020 | | | \a 9781611970265 (electronic bk.) |
| 020 | | | \z 0898711878 (pbk.) |
| 020 | | | \z 9780898711875 (pbk.) |
| 028 | 5 | 0 | \a CB44 \b SIAM |
| 039 | | 9 | \a 201405141731 \b VLOAD \y 201202131224 \z Siladitya |
| 082 | 0 | 4 | \a 001.64/2 \2 19 |
| 100 | 1 | | \a Tarjan, Robert E. \q (Robert Endre), \d 1948- |
| 245 | 1 | 0 | \a Data structures and network algorithms \h [electronic resource] / \c Robert Endre Tarjan. |
| 260 | | | \a Philadelphia, Pa. : \b Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), \c 1983. |
| 300 | | | \a 1 electronic text (vii, 131 p.) : \b ill., digital file. |
| 490 | 1 | | \a CBMS-NSF regional conference series in applied mathematics ; \v 44 |
| 504 | | | \a Includes bibliographical references (p. 125-131). |
| 505 | 0 | | \a Foundations -- Disjoint sets -- Heaps -- Search trees -- Linking and cutting trees -- Minimum spanning trees -- Shortest paths -- Network flows -- Matchings. |
| 506 | | | \a Restricted to subscribers or individual electronic text purchasers. |
| 520 | 3 | | \a There has been an explosive growth in the field of combinatorial algorithms. These algorithms depend not only on results in combinatorics and especially in graph theory, but also on the development of new data structures and new techniques for analyzing algorithms. Four classical problems in network optimization are covered in detail, including a development of the data structures they use and an analysis of their running time. Data Structures and Network Algorithms attempts to provide the reader with both a practical understanding of the algorithms, described to facilitate their easy implementation, and an appreciation of the depth and beauty of the field of graph algorithms. |
| 530 | | | \a Also available in print version. |
| 538 | | | \a Mode of access: World Wide Web. |
| 538 | | | \a System requirements: Adobe Acrobat Reader. |
| 588 | | | \a Title from title screen, viewed 04/05/2011. |
| 650 | | 0 | \a Data structures (Computer science) |
| 650 | | 0 | \a Computer algorithms. |
| 650 | | 0 | \a Trees (Graph theory) |
| 653 | | | \a Data structures |
| 653 | | | \a Network algorithms |
| 653 | | | \a Trees |
| 653 | | | \a Disjoint sets |
| 653 | | | \a Heaps |
| 653 | | | \a Shortest paths |
| 653 | | | \a Matchings |
| 710 | 2 | | \a Society for Industrial and Applied Mathematics. |
| 776 | 0 | 8 | \i Print version: \z 0898711878 \z 9780898711875 \w (DLC) 83061374 |
| 830 | | 0 | \a CBMS-NSF regional conference series in applied mathematics ; \v 44. |
| 856 | 4 | 8 | \3 SIAM \u http://epubs.siam.org/ebooks/siam/cbms-nsf_regional_conference_series_in_applied_mathematics/cb44 \y SIAM |
|
|
