Zobrazeno 1 - 10
of 586
pro vyhledávání: '"Output-sensitive algorithm"'
Publikováno v:
Theory of Computing Systems
Theory of Computing Systems, 2021, 65 (5), pp.777-797. ⟨10.1007/s00224-020-10018-5⟩
Theory of Computing Systems, 65(5), 777-797. Springer New York
Theory of Computing Systems, 65, 777-797
Ayad, L A K, Badkobeh, G, Fici, G, Héliou, A & Pissis, S P 2021, ' Constructing Antidictionaries of Long Texts in Output-Sensitive Space ', Theory of Computing Systems, vol. 65, no. 5, pp. 777-797 . https://doi.org/10.1007/s00224-020-10018-5
Theory of Computing Systems, 2021, 65 (5), pp.777-797. ⟨10.1007/s00224-020-10018-5⟩
Theory of Computing Systems, 65(5), 777-797. Springer New York
Theory of Computing Systems, 65, 777-797
Ayad, L A K, Badkobeh, G, Fici, G, Héliou, A & Pissis, S P 2021, ' Constructing Antidictionaries of Long Texts in Output-Sensitive Space ', Theory of Computing Systems, vol. 65, no. 5, pp. 777-797 . https://doi.org/10.1007/s00224-020-10018-5
A wordxthat is absent from a wordyis calledminimalif all its proper factors occur iny. Given a collection ofkwordsy1, … ,ykover an alphabetΣ, we are asked to compute the set$\mathrm {M}^{\ell }_{\{y_1,\ldots ,y_k\}}$M{y1,…,yk}ℓof minimal absen
Autor:
Niklas Zechner, Andrzej Lingas
Publikováno v:
Algorithms, Vol 7, Iss 2, Pp 243-252 (2014)
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 at the algorithm due to Chiba and Nishizeki for listing complete subgraphs of fixed size, a
Externí odkaz:
https://doaj.org/article/b6ebb729c2b54eb2a3d0754a56ca2184
Publikováno v:
Computer-Aided Design and Applications. 17:752-762
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no. 1, Iss Discrete Algorithms (2015)
Discrete Algorithms
Externí odkaz:
https://doaj.org/article/6230b99b88f142758e87ba083e651aef
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Mehdy Roayaei, Mohammadreza Razzazi
Publikováno v:
International Journal of Foundations of Computer Science. 29:1215-1230
We consider the directed Steiner network problem, where given a weighted directed graph [Formula: see text] and [Formula: see text] pairs of vertices [Formula: see text], one has to find the minimum weight subgraph [Formula: see text] of [Formula: se
Publikováno v:
IEEE Transactions on Neural Networks and Learning Systems. 29:792-806
Reducing samples through convex hull vertices selection (CHVS) within each class is an important and effective method for online classification problems, since the classifier can be trained rapidly with the selected samples. However, the process of C
Autor:
Miroslav Rada, Michal Černý
Publikováno v:
SIAM Journal on Discrete Mathematics. 32:455-473
We design a new algorithm, called Incremental Enumeration (IncEnu), for the enumeration of full-dimensional cells of hyperplane arrangements (or dually, for the enumeration of vertices of generator...
Publikováno v:
Wuhan University Journal of Natural Sciences. 22:465-471
In this paper, we propose an arc-search interior-point algorithm for convex quadratic programming with a wide neighborhood of the central path, which searches the optimizers along the ellipses that approximate the entire central path. The favorable p
Publikováno v:
Theoretical Computer Science. 702:48-59
Bounding hulls such as convex hull, -shape, -hull, concave hull, crust, etc. offer a wide variety of useful applications. In this paper, we explore another bounding hull, namely -concave hull, as a generalization of convex hull. The parameter determi