Zobrazeno 1 - 10
of 1 289
pro vyhledávání: '"Santos, Vinicius"'
Autor:
Gomes, Guilherme C. M., Masquio, Bruno P., Pinto, Paulo E. D., Rautenbach, Dieter, Santos, Vinicius F. dos, Szwarcfiter, Jayme L., Werner, Florian
A matching is said to be disconnected if the saturated vertices induce a disconnected subgraph and induced if the saturated vertices induce a 1-regular graph. The disconnected and induced matching numbers are defined as the maximum cardinality of suc
Externí odkaz:
http://arxiv.org/abs/2409.04855
A matching cut of a graph is a partition of its vertex set in two such that no vertex has more than one neighbor across the cut. The Matching Cut problem asks if a graph has a matching cut. This problem, and its generalization d-cut, has drawn consid
Externí odkaz:
http://arxiv.org/abs/2407.02898
Autor:
Gomes, Guilherme C. M., Legrand-Duchesne, Clément, Mahmoud, Reem, Mouawad, Amer E., Okamoto, Yoshio, Santos, Vinicius F. dos, van der Zanden, Tom C.
We study the problem of reconfiguring one minimum $s$-$t$-separator $A$ into another minimum $s$-$t$-separator $B$ in some $n$-vertex graph $G$ containing two non-adjacent vertices $s$ and $t$. We consider several variants of the problem as we focus
Externí odkaz:
http://arxiv.org/abs/2307.07782
Autor:
Gris, Lucas Rafael Stefanel, Junior, Arnaldo Candido, Santos, Vinícius G. dos, Dias, Bruno A. Papa, Leite, Marli Quadros, Svartman, Flaviane Romani Fernandes, Aluísio, Sandra
The NURC Project that started in 1969 to study the cultured linguistic urban norm spoken in five Brazilian capitals, was responsible for compiling a large corpus for each capital. The digitized NURC/SP comprises 375 inquiries in 334 hours of recordin
Externí odkaz:
http://arxiv.org/abs/2210.07852
For a fixed property (graph class) ${\Pi}$, given a graph G and an integer k, the ${\Pi}$-deletion problem consists in deciding if we can turn $G$ into a graph with the property ${\Pi}$ by deleting at most $k$ edges. The ${\Pi}$-deletion problem is k
Externí odkaz:
http://arxiv.org/abs/2210.03839
A jump is a pair of consecutive elements in an extension of a poset which are incomparable in the original poset. The arboreal jump number is an NP-hard problem that aims to find an arboreal extension of a given poset with minimum number of jumps. Th
Externí odkaz:
http://arxiv.org/abs/2209.01270
A strong geodetic set of a graph~$G=(V,E)$ is a vertex set~$S \subseteq V(G)$ in which it is possible to cover all the remaining vertices of~$V(G) \setminus S$ by assigning a unique shortest path between each vertex pair of~$S$. In the Strong Geodeti
Externí odkaz:
http://arxiv.org/abs/2208.01796
Background: Systematic literature review (SLR) has been widely adopted to synthesize evidence in a reliable and unbiased manner. The process of conducting SLR is rigorous and well-known; however, most SLR have not followed this process systematically
Externí odkaz:
http://arxiv.org/abs/2206.11936
Autor:
Iwazaki, Anderson Yoshiaki, Santos, Vinicius dos, Felizardo, Katia Romero, de Souza, /'Erica Ferreira, Valentim, Natasha M. C., Nakagawa, Elisa Yumi
Graduate courses can provide specialized knowledge for Ph.D. and Master's students and contribute to develop their hard and soft skills. At the same time, Systematic Literature Review (SLR) has been increasingly adopted in the computing area as a val
Externí odkaz:
http://arxiv.org/abs/2205.07847
Autor:
dos Santos, Vinicius, Iwazaki, Anderson Y., Felizardo, Katia R., de Souza, Érica F., Nakagawa, Elisa Y.
Publikováno v:
In Information and Software Technology December 2024 176
