Algorithms and Data Structures: 2nd Workshop, WADS '91 by Walter Cunto, J. Ian Munro, Patricio V. Poblete (auth.),

By Walter Cunto, J. Ian Munro, Patricio V. Poblete (auth.), Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro (eds.)

This quantity offers the lawsuits of the second one Workshop on Algorithms and information buildings (WADS '91), held at Carleton college in Ottawa. The workshop was once prepared through the varsity of laptop technological know-how at Carleton college. The workshop alternates with the Scandinavian Workshop on set of rules concept (SWAT), carrying on with the culture of SWAT '88 (LNCS, Vol. 318), WADS '89 (LNCS, Vol. 382), and SWAT '90 (LNCS, Vol. 447). From 107 papers submitted, 37 have been chosen for presentation on the workshop. furthermore, there have been five invited presentations.

Show description

Read or Download Algorithms and Data Structures: 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings PDF

Best algorithms and data structures books

Non-Standard Inferences in Description Logics

Description logics (DLs) are used to symbolize established wisdom. Inference companies checking out consistency of information bases and computing subconcept/superconcept hierarchies are the most characteristic of DL platforms. extensive learn over the past fifteen years has resulted in hugely optimized structures that let to cause approximately wisdom bases successfully.

MDDL and the Quest for a Market Data Standard: Explanation, Rationale, and Implementation (The Elsevier and Mondo Visione World Capital Markets)

The purpose of this ebook is to supply an target seller self reliant review of the industry facts Definition Language (MDDL), the eXtensible Mark-up Language (XML) ordinary for industry info. Assuming little earlier wisdom of the normal, or of platforms networking, the e-book identifies the demanding situations and value of the normal, examines the company and marketplace drivers and offers choice makers with a transparent, concise and jargon unfastened learn.

Business Intelligence: Data Mining and Optimization for Decision Making

Enterprise intelligence is a wide type of purposes and applied sciences for collecting, offering entry to, and interpreting information for the aim of aiding company clients make higher company judgements. The time period implies having a finished wisdom of all elements that impact a company, reminiscent of clients, rivals, enterprise companions, monetary atmosphere, and inner operations, for that reason allowing optimum judgements to be made.

Error-Free Polynomial Matrix Computations

This booklet is written as an creation to polynomial matrix computa­ tions. it's a significant other quantity to an previous ebook on equipment and purposes of Error-Free Computation by means of R. T. Gregory and myself, released by means of Springer-Verlag, manhattan, 1984. This ebook is meant for seniors and graduate scholars in desktop and procedure sciences, and arithmetic, and for researchers within the fields of desktop technological know-how, numerical research, structures thought, and computing device algebra.

Additional resources for Algorithms and Data Structures: 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings

Sample text

A computational study of external memory bfs algorithms. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 601–610 (2006) 30 D. Ajwani and U. Meyer 5. : Improved external memory BFS implementation. In: Proceedings of the workshop on Algorithm Engineering and Experiments (ALENEX), pp. 3–12 (2007) 6. : A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. In: Proceedings of the 18th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.

Cycles that are contained in at least one minimum cycle basis of G are called relevant cycles [11,13] (defined there only for GF (2)). Vismara [13] showed the following result for GF (2); it is valid for arbitrary fields. Lemma 5. Let G be a graph. A cycle C ∈ C(G) is relevant if and only if there do not exist simple cycles, C 1 , . . , C k , with the property that C = C 1 + · · ·+ C k and w(C i ) < w(C) for all i = 1, . . , k. For GF (2), the addition of two cycles C 1 and C 2 corresponds to the symmetric difference C 1 + C 2 = C 1 ⊕ C 2 = (E(C 1 ) ∪ E(C 2 )) \ E(C 1 ∩ C 2 ) of the underlying edge sets.

In: Proceedings of the 8th Symposium on Parallel and Distributed Processing, pp. 169–177. IEEE, Los Alamitos (1996) 47. : Algorithms and experiments for the webgraph. , Zwick, U. ) ESA 2003. LNCS, vol. 2832, pp. 703–714. Springer, Heidelberg (2003) 48. : Parallel ear decomposition search (EDS) and st-numbering in graphs. Theoretical Computer Science 47, 277–298 (1986) 49. : External-memory Breadth-First Search with sublinear I/O. , Raman, R. ) ESA 2002. LNCS, vol. 2461, pp. 723–735. Springer, Heidelberg (2002) 50.

Download PDF sample

Rated 4.39 of 5 – based on 46 votes