2489 search results - page 147 / 498 » On the Subgroup Distance Problem |
121
click to vote
ICALP
1995
Springer
15 years 7 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...
124
click to vote
SGP
2007
15 years 6 months ago
2007
We propose a constraint-based method for the fairing of surface meshes. The main feature of our approach is that the resulting smoothed surface remains within a prescribed distanc...
120
Voted
ACL
2010
15 years 2 months ago
2010
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
157
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
173
click to vote
COR
2008
15 years 3 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...