ISAAC
1995
Springer
15 years 8 months ago
1995
Springer
100
click to vote
ISAAC
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. The minimum-redundancy prefix codeproblem is to deter
119
Voted
ISAAC
1995
Springer
15 years 8 months ago
1995
Springer
An extended abstract of this paper will be presented at the Sixth Annual International Symposium on Algorithms and Computation.
131
Voted
ISAAC
1995
Springer
15 years 8 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...