4315 search results - page 80 / 863 » Sorting in linear time |
CPM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
ISAAC
2000
Springer
13 years 11 months ago
2000
Springer
ESA
1997
Springer
13 years 11 months ago
1997
Springer
FOCS
1997
IEEE
13 years 11 months ago
1997
IEEE
ISAAC
1995
Springer
13 years 11 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...