Algorithms and Complexity: Third Italian Conference, CIAC'97, Rome, Italy, March 12-14, 1997, Proceedings
Springer Science & Business Media, Feb 26, 1997 - Computers - 310 pages
This book constitutes the refereed proceedings of the Third Italian Conference on Algorithms and Complexity, CIAC'97, held in Rome, Italy in March 1997.
The 25 revised full papers included in the volume were carefully selected from a total of 74 submissions; also included is an invited paper and an invited abstract. All in all, the papers present an interesting snapshot of current research activities and recent results in theory and applications of sequential, distributed, and parallel algorithms, data structures, and computational complexity.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
approximation assignment assume binary tree bipartite graph Boolean functions bounded BSP-like centers chordal graph color complexity Computer Science consider constant contains Corollary cost cubic graphs data structure defined definition degeneracies degree delete denote distance decomposition distance width edge exists external arc fc-connected fc-out-connected finite function f Gabriel drawing given goto Graph Drawing graph G IEEE input integer internal isomorphic Kolmogorov complexity L-reduction labels layered graphs leaf Lemma m-complete machine maximal maximum merge mergesort minimum weight node NP-complete obtained OCCP problem one-way functions operations optimal pair paper parameter permutive planar points polygon polynomial Proc Proof query random rebalancing recursion red-black tree regular projection relaxed balanced resp result rooted sample schedule self-dual sequence solution space steps string subarrays subgraph subset subtree suffix tree Theorem tree distance treewidth tuple up-in up-out request update variables vertex vertices