Results 1 to 10 of about 1,275,858 (359)
Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\Delta$-Coloring [PDF]
TheoretiCS, 2023 Every graph with maximum degree $\Delta$ can be colored with $(\Delta+1)$ colors using a simple greedy algorithm. Remarkably, recent work has shown that one can find such a coloring even in the semi-streaming model.
Sepehr Assadi +2 more
doaj +1 more source
Evacuating Robots from a Disk Using Face-to-Face Communication [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Assume that two robots are located at the centre of a unit disk. Their goal is to evacuate from the disk through an exit at an unknown location on the boundary of the disk.
Jurek Czyzowicz +5 more
doaj +1 more source
On-line algorithms for multiplication and division in real and complex numeration systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A positional numeration system is given by a base and by a set of digits. The base is a real or complex number $\beta$ such that $|\beta|>1$, and the digit set $A$ is a finite set of digits including $0$. Thus a number can be seen as a finite or infinite
Christiane Frougny +3 more
doaj +1 more source
Fast Diameter Computation within Split Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 When can we compute the diameter of a graph in quasi linear time? We address this question for the class of {\em split graphs}, that we observe to be the hardest instances for deciding whether the diameter is at most two.
Guillaume Ducoffe +2 more
doaj +1 more source
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 In this article we focus on the parameterized complexity of the Multidimensional Binary Vector Assignment problem (called \BVA). An input of this problem is defined by $m$ disjoint sets $V^1, V^2, \dots, V^m$, each composed of $n$ binary vectors of size $
Marin Bougeret +3 more
doaj +1 more source
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
New Results on Directed Edge Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We study a family of generalizations of Edge Dominating Set on directed graphs called Directed $(p,q)$-Edge Dominating Set. In this problem an arc $(u,v)$ is said to dominate itself, as well as all arcs which are at distance at most $q$ from $v$, or at ...
Rémy Belmonte +4 more
doaj +1 more source
THE ROLE OF METHODOLGY IN PEDAGOGICAL RESEARCH IN TERMS OF IMPROVING SKILLS OF HIGH SCHOOL STUDENTS PROGRAMMING [PDF]
Journal of International Legal Communication, 2021 This paper presents analysis of learning and programming skills of students in High School, course computer technician. Students from all grades participated in the research.
Linda Jurakovic +2 more
doaj +1 more source
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
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