Sciweavers

18306 search results - page 351 / 3662
» Algorithmics in Exponential Time
Sort
View
DM
1998
56views more  DM 1998»
15 years 6 months ago
Factoring cardinal product graphs in polynomial time
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
Wilfried Imrich
IPL
2010
79views more  IPL 2010»
15 years 5 months ago
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
Christophe Crespelle, Philippe Gambette
ICONIP
2009
15 years 4 months ago
A Markov Model for Multiagent Patrolling in Continuous Time
Abstract. We present a model for the multiagent patrolling problem with continuous-time. An anytime and online algorithm is then described and extended to asynchronous multiagent d...
Jean-Samuel Marier, Camille Besse, Brahim Chaib-dr...
IWOCA
2010
Springer
229views Algorithms» more  IWOCA 2010»
15 years 1 months ago
Ranking and Drawing in Subexponential Time
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimiza...
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov,...
110
Voted
EDBT
2009
ACM
100views Database» more  EDBT 2009»
15 years 11 months ago
A view selection algorithm with performance guarantee
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
Nicolas Hanusse, Sofian Maabout, Radu Tofan