Zobrazeno 1 - 10
of 121
pro vyhledávání: '"Fábio Protti"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 26:2, Iss Graph Theory (2024)
A walk $u_0u_1 \ldots u_{k-1}u_k$ is a \textit{weakly toll walk} if $u_0u_i \in E(G)$ implies $u_i = u_1$ and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. A set $S$ of vertices of $G$ is {\it weakly toll convex} if for any two non-adjacent vertices $x,y \
Externí odkaz:
https://doaj.org/article/da2fd862867d4c6f98f020ec82c633bb
Autor:
Thays A. Oliveira, Yuri B. Gabrich, Helena Ramalhinho, Miquel Oliver, Miri W. Cohen, Luiz S. Ochi, Serigne Gueye, Fábio Protti, Alysson A. Pinto, Diógenes V. M. Ferreira, Igor M. Coelho, Vitor N. Coelho
Publikováno v:
Future Internet, Vol 12, Iss 2, p 22 (2020)
Cities are constantly transforming and, consequently, attracting efforts from researchers and opportunities to the industry. New transportation systems are being built in order to meet sustainability and efficiency criteria, as well as being adapted
Externí odkaz:
https://doaj.org/article/abecd8619f434dabbaaea83d326d3a88
Autor:
Fábio Protti, Uéverton S. Souza
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 20 no. 2, Iss Graph Theory (2018)
A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic. In this work we present results on m
Externí odkaz:
https://doaj.org/article/06c5685eef1d426bb9a0214da50531f9
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 16 no. 3, Iss Analysis of Algorithms (2014)
Analysis of Algorithms
Externí odkaz:
https://doaj.org/article/e0b1824f48bf49ca8d021776d3e98ca3
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 15 no. 3, Iss Graph Theory (2013)
Graph Theory
Externí odkaz:
https://doaj.org/article/29eab7028c394fcfa9830c59f32a8b48
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 13 no. 1, Iss Graph and Algorithms (2011)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/29188bb88eeb4839a226957eff77edff
Autor:
Márcia R. Cappelle, Erika M.M. Coelho, Hebert Coelho, Braully R. Silva, Uéverton S. Souza, Fábio Protti
Publikováno v:
Discrete Applied Mathematics. 321:368-378
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab123eebeed832c149838c93f814498f
https://doi.org/10.1016/j.dam.2022.07.013
https://doi.org/10.1016/j.dam.2022.07.013
Publikováno v:
Theoretical Computer Science. 909:97-109
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a049702b3e7966e89e7005bf3ade0791
https://doi.org/10.1016/j.tcs.2022.01.031
https://doi.org/10.1016/j.tcs.2022.01.031
Publikováno v:
Discrete Applied Mathematics. 306:89-97
An edge clique partition of G is a set of edge-disjoint cliques of G which together contain every edge of G . In this work we investigate the computational complexity of determining the minimum size of an edge clique partition of G , denoted by c p (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89efa15287c60da2f6000fe503fc53ba
https://doi.org/10.1016/j.dam.2021.09.035
https://doi.org/10.1016/j.dam.2021.09.035
Autor:
Luiz Satoru Ochi, Teobaldo Bulhões, Lucídio dos Anjos Formiga Cabral, Fábio Protti, Rian G. S. Pinheiro, Gilberto Farias de Sousa Filho
Publikováno v:
Discrete Applied Mathematics. 301:118-130
Given a bipartite graph G = ( V 1 , V 2 , E ) , a biclique of G is a complete bipartite subgraph of G , and a biclique partitioning of G is a set A ⊆ E such that the bipartite graph G ′ = ( V 1 , V 2 , A ) is a vertex-disjoint union of bicliques.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7feb6afdc2775dd6160ee42779ada8ac
https://doi.org/10.1016/j.dam.2021.05.023
https://doi.org/10.1016/j.dam.2021.05.023