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

AnO(n+m) Certifying Triconnnectivity Algorithm for

โœ Scribed by Amr Elmasry; Kurt Mehlhorn; Jens M. Schmidt

Book ID
106149177
Publisher
Springer
Year
2010
Tongue
English
Weight
478 KB
Volume
62
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

AnO(n) Algorithm for Abelianp-Group Isom
AnO(n) Algorithm for Abelianp-Group Isomorphism and anO(n log n) Algorithm for Abelian Group Isomorphism
โœ Narayan Vikas ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 417 KB

The isomorphism problem for groups is to determine whether two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. Tarjan has shown that this problem can be done in time O(n log n + O(1) ) for groups of cardinality n. Savage has claimed an algorithm

AnO(log*n) Approximation Algorithm for t
AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
โœ Rina Panigrahy; Sundar Vishwanathan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 130 KB

The input to the asymmetric p-center problem consists of an integer p and an n = n distance matrix D defined on a vertex set V of size n, where d gives the i j distance from i to j. The distances are assumed to obey the triangle inequality. For a subset S : V the radius of S is the minimum distance