Zobrazeno 1 - 10
of 4 934
pro vyhledávání: '"A. Mitre"'
Autor:
Natália Corradi Drumond Mitre, Rosângela Corrêa Dias, João Marcos Domingues Dias, Ana Paula Santos Faria, Dulce Cornélio da Costa, Gisele Marques de Carvalho, Ana Carolina Pinto Ribeiro
Publikováno v:
Geriatrics, Gerontology and Aging, Vol 2, Pp 104-109 (2024)
Objetivos: Traduzir para a língua portuguesa o Teste de Desempenho Físico (Physical Performance Test) em uma versão modificada e avaliar sua consistência interna e a confiabilidade intra e interexaminadores. Material e Métodos: O processo de ada
Externí odkaz:
https://doaj.org/article/f6311f78077b45719edbd40ea7503a18
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 25:2, Graph Theory (March 22, 2024) dmtcs:11423
In this corrigendum, we give a counterexample to Theorem 5.2 in "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]. We also present a polynomial-time algorithm for computing the monophonic rank of a starlike graph
Externí odkaz:
http://arxiv.org/abs/2305.19277
In this paper, we study two graph convexity parameters: iteration time and general position number. The iteration time was defined in 1981 in the geodesic convexity, but its computational complexity was so far open. The general position number was de
Externí odkaz:
http://arxiv.org/abs/2305.00467
Autor:
Mitre, Lucas P., Palavani, Lucca B., Batista, Sávio, Andreão, Filipi F., Mitre, Edson I., de Andrade, Erion J., Rassi, Marcio S.
Publikováno v:
In World Neurosurgery October 2024 190:22-32
A walk $u_0u_1 \ldots u_{k-1}u_k$ of a graph $G$ is a \textit{weakly toll walk} if $u_0u_k \not\in E(G)$, $u_0u_i \in E(G)$ implies $u_i = u_1$, and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. The {\em weakly toll interval} of a set $S \subseteq V(G)$, d
Externí odkaz:
http://arxiv.org/abs/2303.07414
Autor:
Antônio José Rodrigues Pereira, Ricardo Zugaib Abdalla, Silvia Kobayashi, Fábio Augusto Rodrigues Goncalves, Evelinda Trindade, Ivan Cecconello, Ulysses Ribeiro Junior, Rubens Antônio Aissar Sallum, Flávio Takeda, Júlio Mariano da Rocha, Marcos de Oliveira Tacconi, Ulysses Ribeiro Júnior, Osmar Kenji, Antonio Rocco Imperiale, Marcus Kodama, Caio Sérgio Nahas, Guilherme Cotti, Carlos Frederico Sparapam Marques, Diego Fernandes Maia Soares, Alexandre Silva e Silva, João Paulo Mancusi de Carvalho, Marco Aurélio Kulcsar, William Carlos Nahas, Rafael Coelho, Anuar Ibrahim Mitre, José Roberto Colombo, Claudio Bonovolenta Murta, Daher Cezar Chade, Luiz Carlos Neves de Oliveira, José Pontes Junior, Adriano João Nesrallah, Guilherme Philomeno Padovani, Marcelo Bento Linhares, Matheus Chaib, Daniel Kanda Abe, Ricardo M Terra, Paulo Pego, Pedro Henrique Xavier Nabuco de Araujo, Letícia Leone Lauricella, Herbert Felix Costa
Publikováno v:
Jornal de Assistência Farmacêutica e Farmacoeconomia, Vol 9, Iss s. 1 (2024)
Introdução O Ministério da Saúde, MS, vem adquirindo inovações promissoras e controvertidas e as testando mediante estudos controlados em polos de referência da Rede SUS. Apresenta-se o exemplo da aquisição de um robô cirúrgico visando
Externí odkaz:
https://doaj.org/article/19576e03d9354c6a8a43ee494c98ca16
Autor:
Dourado, Mitre C., Oliveira, Rodolfo A., Ponciano, Vitor, Queiróz, Alessandra B., Silva, Rômulo L. O.
Given a graph $G$ such that each vertex $v_i$ has a value $f(v_i)$, the expanded-clique graph $H$ is the graph where each vertex $v_i$ of $G$ becomes a clique $V_i$ of size $f(v_i)$ and for each edge $v_iv_j \in E(G)$, there is a vertex of $V_i$ adja
Externí odkaz:
http://arxiv.org/abs/2208.03411
Let $G$ be a graph having a vertex $v$ such that $H = G - v$ is a trivially perfect graph. We give a polynomial-time algorithm for the problem of deciding whether it is possible to add at most $k$ edges to $G$ to obtain a trivially perfect graph. Thi
Externí odkaz:
http://arxiv.org/abs/2204.06842
Autor:
Palavani, Lucca B., Camerotte, Raphael, Pari Mitre, Lucas, Batista, Sávio, Banderali, Isabela, Vilardo, Marina, Vieira Nogueira, Bernardo, Pereira, Vinicius, Macedo, Leonardo, Bertani, Raphael, Rassi, Márcio S., de Oliveira, Jean G.
Publikováno v:
In World Neurosurgery October 2024 190:487-503
Autor:
Palavani, Lucca B., Camerotte, Raphael, Vieira Nogueira, Bernardo, Ferreira, Márcio Yuri, Oliveira, Leonardo B., Pari Mitre, Lucas, Coelho Nogueira de Castro, Wilson, Canto Gomes, Gisele Lúcia, Fabrini Paleare, Luis F., Batista, Sávio, Fim Andreão, Filipi, Bertani, Raphael, Dias Polverini, Allan
Publikováno v:
In Journal of Clinical Neuroscience October 2024 128