A constrained edit distance between unordered labeled trees
This paper considers the problem of computing a constrained edit distance between unordered labeled trees. The problem of approximate unordered tree matching is also considered. We present dynamic programming algorithms solving these problems in ...
Incremental topological flipping works for regular triangulations
A set ofn weighted points in general position in źd defines a unique regular triangulation. This paper proves that if the points are added one by one, then flipping in a topological order will succeed in constructing this triangulation. If, in addition, ...
Optimal parallel algorithm for findingst-ambitus of a planar biconnected graph
A cycleC passing through two specific verticess andt of a biconnected graph is said to be anst-ambitus if its bridges do not interlace in some special way. We present algorithms forst-ambitus for planar biconnected graphs, which are much simpler than ...
Bidirectional edges problem: Part I--A simple algorithm
The "bidirectional edges problem" is to find an edge-labeling of an undirected network,G=(V, E), with a source and a sink, such that an edge [u, v] źE is labeled (u, v) or (v, u) (or both) depending on the existence of a (simple) path from the source to ...
