Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Marcelo Henriques de Carvalho"'
Publikováno v:
Journal of Graph Theory. 95:594-637
A brick is a $3$-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick $G$ is near-bipartite if it has a pair of edges $\alpha$ and $\beta$ such that $G-\{\alpha,\beta\}$ is biparti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7f5f5644506ec0ada21ed7e654adedd
https://doi.org/10.1002/jgt.22579
https://doi.org/10.1002/jgt.22579
Publikováno v:
Journal of Combinatorics. 9:163-184
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb899861eb4d8440644592164aaa55fb
https://doi.org/10.4310/joc.2018.v9.n1.a8
https://doi.org/10.4310/joc.2018.v9.n1.a8
Autor:
Marcelo Henriques de Carvalho, C B Pache Marcio, Willian Paraguassu Amorim, Hemerson Pistori, Felipe Silveira Brito Borges
Publikováno v:
2019 XV Workshop de Visão Computacional (WVC).
In this paper, the Optimum-Path Forest (OPF) classifier is applied in the classification of defects in cowhide, a problem of great evaluation complexity. The OPF classifier reduces a pattern classification problem to the problem of partitioning the v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d0355582e7950d78eb4809378b6b70c
https://doi.org/10.1109/wvc.2019.8876936
https://doi.org/10.1109/wvc.2019.8876936
Autor:
Nishad Kothari, Cláudio Leonardo Lucchesi, Marcelo Henriques de Carvalho, Charles H. C. Little
Lov\'asz (1987) proved that every matching covered graph $G$ may be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite); we let $b(G)$ denote the number of bricks. An edge $e$ is removable if $G-e$ is also matching covered
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd9d636204089417a6f252ae64a52119
A well-studied geometric object in combinatorial optimization is the perfect matching polytope of a graph $G$. In any investigation concerning the perfect matching polytope, one may assume that $G$ is matching covered --- that is, it is a connected g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e0354811c781a61588bccd8e5e1faec
A cut $C:=\partial(X)$ of a matching covered graph $G$ is a separating cut if both its $C$-contractions $G/X$ and $G/\overline{X}$ are also matching covered. A brick is solid if it is free of nontrivial separating cuts. In 2004, we (Carvalho, Lucches
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ad67fff6d1d6035efe6bd2503728ccf
http://arxiv.org/abs/1705.09428
http://arxiv.org/abs/1705.09428
Autor:
Marcelo Henriques de Carvalho, Willian Paraguassu Amorim, Alexandre X. Falcão, João Paulo Papa
Publikováno v:
Web of Science
Repositório Institucional da UNESP
Universidade Estadual Paulista (UNESP)
instacron:UNESP
Repositório Institucional da UNESP
Universidade Estadual Paulista (UNESP)
instacron:UNESP
Made available in DSpace on 2018-11-26T17:06:13Z (GMT). No. of bitstreams: 0 Previous issue date: 2016-12-01 Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b027a359004ba9993d44f154ec9561e8
Publikováno v:
Electronic Notes in Discrete Mathematics. 37:171-176
Join covered graphs are ±1-weighted graphs, without negative circuits, in which every edge lies in a zero-weight circuit. Join covered graphs are a natural generalization of matching covered graphs. Many important properties of matching covered grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f6174b147204dee324190ee5a53d4db
https://doi.org/10.1016/j.endm.2011.05.030
https://doi.org/10.1016/j.endm.2011.05.030
Autor:
Jancarlo Ferreira Gomes, Priscila T. M. Saito, Pedro J. de Rezende, Celso Tetsuo Nagase Suzuki, Marcelo Henriques de Carvalho, Willian Paraguassu Amorim, Alexandre X. Falcão
Publikováno v:
ICPR
The development of effective and efficient ways of handling real-world applications is becoming increasingly widespread, yet it still faces a number of practical challenges. First and foremost, we have the limited availability of labeled data in cont
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87d732153d18d187a23f744319e916ff
https://doi.org/10.1109/icpr.2014.652
https://doi.org/10.1109/icpr.2014.652