Search Results - "parameterized algorithm"
-
1
A faster parameterized algorithm for temporal matching
ISSN: 0020-0190, 1872-6119Published: Elsevier B.V 01.03.2022Published in Information processing letters (01.03.2022)“…—describing a graph topology which is subject to discrete changes over time. A Δ-temporal matching M is a set of time edges (e…”
Get full text
Journal Article -
2
A Faster Parameterized Algorithm for Temporal Matching
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 23.04.2021Published in arXiv.org (23.04.2021)“…A temporal graph is a sequence of graphs (called layers) over the same vertex set -- describing a graph topology which is subject to discrete changes over time. A \(\Delta\)-temporal matching \(M…”
Get full text
Paper -
3
Parameterized analysis and crossing minimization problems
ISSN: 1574-0137, 1876-7745Published: Elsevier Inc 01.08.2022Published in Computer science review (01.08.2022)“…In this survey/introductory article, we first present the basics of the field of Parameterized Complexity, made accessible to readers without background on the subject…”
Get full text
Journal Article -
4
Complexity of Secure Sets
ISSN: 0178-4617, 1432-0541Published: New York Springer US 01.10.2018Published in Algorithmica (01.10.2018)“… In this work, we pinpoint the complexity of this problem by showing that it is Σ 2 P -complete. Furthermore, the problem has so far not been subject to a parameterized complexity analysis that considers structural parameters…”
Get full text
Journal Article -
5
Comparing Personal Image Collections with PICTuReVis
ISSN: 0167-7055, 1467-8659Published: Oxford Blackwell Publishing Ltd 01.06.2017Published in Computer graphics forum (01.06.2017)“… Similar temporal and spatial patterns can be found using a parameterized algorithm, visualization is used to choose the right parameters and to inspect the patterns found…”
Get full text
Journal Article -
6
Algorithms for Circuits and Circuits for Algorithms
ISSN: 1093-0159Published: IEEE 01.06.2014Published in 2014 IEEE 29th Conference on Computational Complexity (CCC) (01.06.2014)“…The title of this paper is meant to highlight an emerging duality between two fundamental topics in algorithms and complexity theory. Algorithms for circuits}…”
Get full text
Conference Proceeding -
7
Budgeted Matroid Maximization: a Parameterized Viewpoint
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 09.07.2023Published in arXiv.org (09.07.2023)“… in the \(\ell\)-matchoid a feasible set \(S\) of maximum profit \(p(S)\) subject to the budget constraint, i.e., \(c(S) \leq B\). The {\em budgeted \(\ell\)-matchoid} (BM…”
Get full text
Paper -
8
Minimization of an Integral Quadratic Estimate of the Controlled Variable in Systems with Distributed Parameters
ISSN: 1064-2307, 1555-6530Published: Moscow Pleiades Publishing 01.02.2024Published in Journal of computer & systems sciences international (01.02.2024)“…A constructive method for solving the linear-quadratic problem of the optimal control of a parabolic-type system with distributed parameters is proposed under…”
Get full text
Journal Article -
9
Integration of the methods of algebra of algorithms and computational intelligence for automation of program systems design
ISSN: 2710-1673, 2710-1681Published: 20.09.2023Published in Artificial Intelligence (20.09.2023)“…An approach to the creation of intelligent systems is considered, which combines the ideas of Glushkov’s algebra of algorithms with the well-known…”
Get full text
Journal Article -
10
Answer Set Solving exploiting Treewidth and its Limits
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 05.05.2019Published in arXiv.org (05.05.2019)“…Parameterized algorithms have been subject to extensive research of recent years and allow to solve hard problems by exploiting a parameter of the corresponding problem instances…”
Get full text
Paper