2069 search results - page 27 / 414 » Linear time algorithms for Clobber |
SODA
1994
ACM
15 years 5 months ago
1994
ACM
162
click to vote
JDA
2007
15 years 3 months ago
2007
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...
125
click to vote
ISAAC
1995
Springer
15 years 7 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...
162
click to vote
LATIN
1995
Springer
15 years 7 months ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...