Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Claudia Marcela Justel"'
Publikováno v:
Linear Algebra and its Applications. 614:68-81
In this paper, structural properties of chordal graphs are analysed, in order to establish a relationship between these structures and integer Laplacian eigenvalues. We present the characterization of chordal graphs with equal vertex and algebraic co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29c9e2382988907797dc0691c47cfccb
https://doi.org/10.1016/j.laa.2019.12.030
https://doi.org/10.1016/j.laa.2019.12.030
Autor:
Claudia Marcela Justel, Leandro A. S. Moreira, Paulo Fernando Ferreira Rosa, Jauvane C. de Oliveira
Publikováno v:
Robotica. 39:557-571
SUMMARYThis article proposes a method for incremental data dimensionality reduction in loop closure detection for robotic autonomous navigation. The approach uses dominant eigenvector concept for: (a) spectral description of visual datasets and (b) r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30ae74008456648655ffd799605b7814
https://doi.org/10.1017/s0263574720000570
https://doi.org/10.1017/s0263574720000570
Autor:
Christina Fraga Esteves Maciel Waga, Nair Maria Maia de Abreu, Claudia Marcela Justel, Lilian Markenzon, Carla Silva Oliveira
Publikováno v:
Discrete Applied Mathematics. 269:60-67
We present a characterization of graphs which are simultaneously block and indifference graphs. Some structural and spectral properties of the class are depicted and their interconnection is shown. We show an O ( n ) representation which allows us to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1d33d0b4277e705843be147776570be
https://doi.org/10.1016/j.dam.2018.11.034
https://doi.org/10.1016/j.dam.2018.11.034
Publikováno v:
Discrete Applied Mathematics. 253:51-60
In this work we compare solutions of two distinct algorithms that try to increase the value of the algebraic connectivity of a given graph by choosing, with different strategies, edges to be included. Eccentricity and Perturbation Heuristics were con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7e2254e6e9cb4c60373690cec97c8ea
https://doi.org/10.1016/j.dam.2018.03.069
https://doi.org/10.1016/j.dam.2018.03.069
Publikováno v:
Proyecciones (Antofagasta) v.40 n.4 2021
SciELO Chile
CONICYT Chile
instacron:CONICYT
SciELO Chile
CONICYT Chile
instacron:CONICYT
In this paper, some subclasses of block graphs are considered in order to analyze Fiedler vector of its members. Two families of block graphs with cliques of fixed size, the block-path and block-starlike graphs, are introduced. Cases A and B of class
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8fdd9b40711385afbdf24796472403a5
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000401041
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000401041
Publikováno v:
Intelligent Systems ISBN: 9783030613792
BRACIS (2)
BRACIS (2)
Link prediction is an online social network (OSN) analysis task whose objective is to identify pairs of non-connected nodes with a high probability of getting connected in the near future. Recently, proposed link prediction methods consider topologic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c936e97d91e04d1e666732637fa9994
https://doi.org/10.1007/978-3-030-61380-8_26
https://doi.org/10.1007/978-3-030-61380-8_26
Publikováno v:
Linear and Multilinear Algebra. 65:2046-2063
Given a tree T, we consider a pair of vertices (u, v) where u is a centroid of T, v is a characteristic vertex of T, and such that the distance between them, denoted d(u, v), is smallest over all s...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ab1ca75c08ce82fcb6c9240e3d4baeb
https://doi.org/10.1080/03081087.2017.1304520
https://doi.org/10.1080/03081087.2017.1304520
Publikováno v:
Enterprise Information Systems ISBN: 9783030261689
ICEIS (Revised Selected Papers)
ICEIS (Revised Selected Papers)
The importance of bringing the relational data to other models and technologies has been widely debated. In special, Graph Database Management Systems (DBMS) have gained attention from industry and academia for their analytic potential. One of its ad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c86fde18ced0fd839bc1bd5aebdb379
https://doi.org/10.1007/978-3-030-26169-6_10
https://doi.org/10.1007/978-3-030-26169-6_10
Publikováno v:
Electronic Notes in Discrete Mathematics. 55:13-16
In this work we present a heuristic algorithm to solve the Maximum Algebraic Connectivity Augmentation Problem (MACAP). This is an NP-complete problem (proved by Mosk-Aoyama in 2008) and consists in, given a graph, determining the smallest set of edg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c218dab99a30dd2833b08f4dae63edef
https://doi.org/10.1016/j.endm.2016.10.004
https://doi.org/10.1016/j.endm.2016.10.004
Publikováno v:
ICEIS (2)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37b7a92d43f8cb12ae08dfca8be917cd
https://doi.org/10.5220/0006708700710080
https://doi.org/10.5220/0006708700710080