Suchergebnisse - "Output sensitive algorithm"

Constant amortized time enumeration of Eulerian trails von Kurita, Kazuhiro, Wasa, Kunihiro

“… •Eulerian trails are classical and important objects in theoretical computer science field.•Enumeration of Eulerian trails is known to be #P-complete.•Although …”
Volltext

Constructing Antidictionaries of Long Texts in Output-Sensitive Space von Ayad, Lorraine A.K., Badkobeh, Golnaz, Fici, Gabriele, Héliou, Alice, Pissis, Solon P.

“… A word x that is absent from a word y is called minimal if all its proper factors occur in y . Given a collection of k words y 1 , … , y k over an alphabet Σ , …”
Volltext

A Fast Shortest Path Algorithm on Terrain-like Graphs von Froese, Vincent, Renken, Malte

“… Terrain visibility graphs are a well-known graph class in computational geometry. They are closely related to polygon visibility graphs, but a precise …”
Volltext

Combinatorial redundancy detection von Fukuda, Komei, Gärtner, Bernd, Szedlák, May

“… The problem of detecting and removing redundant constraints is fundamental in optimization. We focus on the case of linear programs (LPs) in dictionary form, …”
Volltext

Computing the Map of Geometric Minimal Cuts von Xu, Jinhui, Xu, Lei, Papadopoulou, Evanthia

“… In this paper we consider the following problem of computing a map of geometric minimal cuts (called MGMC problem): Given a graph G =( V , E ) and a planar …”
Volltext

A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication von Lingas, Andrzej

“… We use randomness to exploit the potential sparsity of the Boolean matrix product in order to speed up the computation of the product. Our new fast …”
Volltext

Efficient Algorithms for Subgraph Listing von Zechner, Niklas, Lingas, Andrzej

“… Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look …”
Volltext

Output sensitive algorithms for covering many points von Ghasemalizadeh, Hossein, Razzazi, Mohammadreza

“… Discrete Algorithms In this paper we devise some output sensitive algorithms for a problem where a set of points and a positive integer, m, are given and the …”
Volltext

Maximum independent set for intervals by divide and conquer with pruning von Snoeyink, Jack

“… Suppose a given set of n intervals contains a maximum independent set of k disjoint intervals. This brief note demonstrates that “divide and conquer with …”
Volltext

Linear time isotonic and unimodal regression in the L 1 and L ∞ norms von Boyarshinov, Victor, Magdon-Ismail, Malik

“… We consider L 1 -isotonic regression and L ∞ isotonic and unimodal regression. For L 1 -isotonic regression, we present a linear time algorithm when the number …”
Volltext

Computing homotopic shortest paths in the plane von Bespamyatnikh, Sergei

“… We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very …”
Volltext

Output-Sensitive Algorithm for Computing β-Skeletons von Mukhopadhyay, A., Rao, S. V.

Volltext

Output-Sensitive Computation of All Form-Closure Grasps of a Semi-Algebraic Set von Jae-Sook Cheong, van der Stappen, A.F.

“… We propose the first efficient output-sensitive algorithms for computing all form-closure grasps of a planar curved part P with at most four frictionless point …”
Volltext

Refined notions of parameterized enumeration kernels with applications to matching cut enumeration von Golovach, Petr A., Komusiewicz, Christian, Kratsch, Dieter, Le, Van Bang

“… An enumeration kernel as defined by Creignou et al. (2017) [11] for a parameterized enumeration problem consists of an algorithm that transforms each instance …”
Volltext

A note on the problem of reporting maximal cliques von Cazals, F., Karande, C.

“… Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this …”
Volltext

Scalable computational geometry in MapReduce von Li, Yuan, Eldawy, Ahmed, Xue, Jie, Knorozova, Nadezda, Mokbel, Mohamed F., Janardan, Ravi

“… Hadoop, employing the MapReduce programming paradigm, has been widely accepted as the standard framework for analyzing big data in distributed environments …”
Volltext

Distributed Alarming in the On-Duty and Off-Duty Models von Bienkowski, Marcin, Gasieniec, Leszek, Klonowski, Marek, Korzeniowski, Miroslaw, Mans, Bernard, Schmid, Stefan, Wattenhofer, Roger

“… Decentralized monitoring and alarming systems can be an attractive alternative to centralized architectures. Distributed sensor nodes (e.g., in the smart …”
Volltext

Planar lower envelope of monotone polygonal chains von Lu, Daniel L.

“… •An algorithm to find the lower envelope of monotone polygonal chains is proposed.•Simpler than known methods and requires no complex data structures.•Applies …”
Volltext

A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations von Miller, Gary L., Sheehy, Donald R.

“… We describe a new algorithm for computing the Voronoi diagram of a set of n points in constant-dimensional Euclidean space. The running time of our algorithm …”
Volltext

Enumerating trichromatic triangles containing the origin in linear time von Elmasry, Amr

“… Consider a set P of n points in the plane, where each point is associated with one of three colours. We give an output-sensitive algorithm that enumerates a …”
Volltext