Effective location-guided tree construction algorithms for small group multicast in MANET

2003 ◽  
Author(s):  
K. Chen ◽  
K. Nahrstedt
Keyword(s):  
Small Group ◽  
Tree Construction ◽  
Construction Algorithms

OPTIMAL PARALLEL CONSTRUCTION OF MINIMAL SUFFIX AND FACTOR AUTOMATA

1996 ◽  
Vol 06 (01) ◽  
pp. 35-44 ◽  
Author(s):  
DANY BRESLAUER ◽  
RAMESH HARIHARAN
Keyword(s):  
Parallel Algorithms ◽  
Data Structures ◽  
Suffix Tree ◽  
Finite Automata ◽  
Suffix Trees ◽  
Deterministic Finite Automata ◽  
Tree Construction ◽  
Parallel Construction ◽  
Construction Algorithms

This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor automata and suffix trees.

scholarly journals Optimal Parallel Construction of Minimal Suffix and Factor Automata

1995 ◽  
Vol 2 (16) ◽  
Author(s):  
Dany Breslauer ◽  
Ramesh Hariharan
Keyword(s):  
Parallel Algorithms ◽  
Data Structures ◽  
Suffix Tree ◽  
Finite Automata ◽  
Suffix Trees ◽  
Deterministic Finite Automata ◽  
Tree Construction ◽  
Parallel Construction ◽  
Construction Algorithms

This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor automata and suffix trees.

Sign in / Sign up

Export Citation Format

Share Document