Results 21 to 30 of about 225,922 (311)
FPT algorithms to recognize well covered graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Given a graph $G$, let $vc(G)$ and $vc^+(G)$ be the sizes of a minimum and a maximum minimal vertex covers of $G$, respectively. We say that $G$ is well covered if $vc(G)=vc^+(G)$ (that is, all minimal vertex covers have the same size).
Rafael Araujo +4 more
doaj +1 more source
Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms [PDF]
Groups, Complexity, Cryptology, 2022 We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in \mathbb{F}_q[x_1,
Joshua A. Grochow +2 more
doaj +1 more source
New Algorithms for Mixed Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.
Louis Dublois +2 more
doaj +1 more source
Algorithms and Data Structures for Hyperedge Queries
ACM Journal of Experimental Algorithmics, 2022 We consider the problem of querying the existence of hyperedges in hypergraphs. More formally, given a hypergraph, we need to answer queries of the form: “Does the following set of vertices form a hyperedge in the given hypergraph?” Our aim is to set up data structures based on hashing to answer these queries as fast as possible.
Bertrand, Jules +3 more
openaire +3 more sources
DATA STRUCTURES AND ALGORITHMS
, 2023 The topic of "Data Structures and Algorithms" is a fundamental subject in the field of computer science and programming. It covers the organization and management of data, as well as the development and analysis of algorithms. This topic is crucial for software developers, computer scientists, and anyone working with computers.
Djangazova, Qumriniso +3 more
openaire +2 more sources
Parameterized Power Vertex Cover [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study a recently introduced generalization of the Vertex Cover (VC) problem, called Power Vertex Cover (PVC). In this problem, each edge of the input graph is supplied with a positive integer demand.
Eric Angel +3 more
doaj +1 more source
An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We present a polynomial time algorithm, which solves a nonstandard Variation of the well-known PARTITION-problem: Given positive integers $n, k$ and $t$ such that $t \geq n$ and $k \cdot t = {n+1 \choose 2}$, the algorithm partitions the elements of the ...
Alexander Büchel +2 more
doaj +1 more source
Structural Parameterizations of the Biclique-Free Vertex Deletion Problem [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \le j$, find a set of at most $k$ vertices that intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$.
Lito Goldmann +2 more
doaj +1 more source
Introduction to local certification [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its output.
Laurent Feuilloley
doaj +1 more source
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Given a graph $G=(V,E)$ and a positive integer $t\geq2$, the task in the vertex cover $P_t$ ($VCP_t$) problem is to find a minimum subset of vertices $F\subseteq V$ such that every path of order $t$ in $G$ contains at least one vertex from $F$.
Zongwen Bai, Jianhua Tu, Yongtang Shi
doaj +1 more source