๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm for finding the largest approximately common substructures of two trees

โœ Scribed by Wang, J.T.L.; Shapiro, B.A.; Shasha, D.; Zhang, K.; Currey, K.M.

Book ID
117873501
Publisher
IEEE
Year
1998
Tongue
English
Weight
133 KB
Volume
20
Category
Article
ISSN
0162-8828

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithm for finding one of the largest
Algorithm for finding one of the largest common subgraphs of two three-dimensional graph structures
โœ Sumio Masuda; Hiroyuki Yoshioka; Eiichi Tanaka ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 176 KB ๐Ÿ‘ 1 views

Given two connected graphs G a = (V a , E a ) and G b = (V b , E b ) with three-dimensional structures. Let n a = |V a |, m a = |E a |, n b = |V b |, and m b = |E b |. Let the maxi- mum order of a vertex in G a (G b ) be l a (l b ). Initially this paper offers a method to find a largest common subgr

A carry-free algorithm for finding the g
A carry-free algorithm for finding the greatest common divisor of two integers
โœ George B. Purdy ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 503 KB

We investigate a variant of the so-called "binary" algorithm for finding the GCD (greatest common divisor) of two numbers which requires no comparisons. We show that when implemented with carry-save hardware, it can be used to find the modulo B inverse of an n-bit binary integer in a time proportion

An Algorithm for Finding the K-Best Allo
An Algorithm for Finding the K-Best Allocations of a Tree Structured Program
โœ A. Billionnet; S. Elloumi ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 592 KB

We consider the problem of allocating \(n\) tasks of a distributed program to \(m\) processors of a distributed system in order to minimize total communication and processing costs. If the intertask communication can be represented by a tree and if the communication costs are uniform, it is known th