Milestones in Computer Science and Information TechnologyBloomsbury Academic, 2003. aug. 30. - 392 oldal Using the same approach as the popular Milestones in Science and Technology and Milestones in Health and Medicine, this unique reference features more than 600 concise entries describing the most significant advances in the field of computer science and information technology. Arranged in a convenient A-to-Z format, entries explain topics in a wide variety of categories, including hardware, software, theory, mathematics, programming, languages, memory, architecture, applications, and graphics. |
Részletek a könyvből
1 - 3 találat összesen 40 találatból.
Edwin Reilly. graph problem ( see Graph theory ) . A Hamil- tonian path is one that visits all nodes in a graph exactly once . Testing whether a partic- ular graph has a Hamiltonian path is an NP- complete problem . In 1995 , Richard ...
... Graph DATA STRUCTURES A graph , or more precisely a connected graph , is a data structure that consists of a collection of data nodes and pointers that connect each node to one or more other nodes of the same graph . A tree is a restricted ...
... Graph Theory . C A B D Figure 19. The famous " Seven Bridges of Königs- berg " ( Prussia ) , over which the good bergers could find no Eulerian circuit . ( From Euler's 1736 paper , reproduced in Biggs , Lloyd , and Wilson , Graph The ...
Tartalomjegyzék
Listing of Cited References | 283 |
Classification of Articles | 297 |
Chronological Index | 343 |
Copyright | |
1 további fejezet nem látható