𝔖 Bobbio Scriptorium
✦   LIBER   ✦

AnO(n3) recognition algorithm for bithreshold graphs

✍ Scribed by S. De Agostino; R. Petreschi; A. Sterbini

Book ID
110547535
Publisher
Springer
Year
1997
Tongue
English
Weight
463 KB
Volume
17
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

A recognition algorithm for the total gr
A recognition algorithm for the total graphs
✍ F. Gavril πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 581 KB

## Abstract A graph H is called total if there exists a graph G such that there is a one‐to‐one correspondence between the vertices of H and the vertices and edges of G such that two vertices of H are adjacent iff the corresponding elements of G are adjacent or incident. In this paper we present a