Results 21 to 30 of about 91,504 (262)
Applied Network Science, 2021 The alignment strength of a graph matching is a quantity that gives the practitioner a measure of the correlation of the two graphs, and it can also give the practitioner a sense for whether the graph matching algorithm found the true matching ...
Donniell E. Fishkind +7 more
doaj +1 more source
Fractional matching preclusion for butterfly derived networks
Theory and Applications of Graphs, 2019 The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
Xia Wang +4 more
doaj +1 more source
Graph homomorphism revisited for graph matching [PDF]
Proceedings of the VLDB Endowment, 2010 In a variety of emerging applications one needs to decide whether a graph G matches another G p , i.e. , whether G has a topological structure similar to that of G p
Fan, Wenfei +4 more
openaire +2 more sources
Even cycles and perfect matchings in claw-free plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Lov{\'a}sz showed that a matching covered graph $G$ has an ear decomposition starting with an arbitrary edge of $G$. Let $G$ be a graph which has a perfect matching.
Shanshan Zhang +2 more
doaj +1 more source
A note on pm-compact bipartite graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2
Liu Jinfeng, Wang Xiumei
doaj +1 more source
Iris Matching Based On a Stack Like Structure Graph Approach
Walailak Journal of Science and Technology, 2012 In this paper, we present the elastic bunch graph matching as a new approach for iris recognition. The task is difficult because of iris variation in terms of position, size, and partial occlusion.
Roushdi Mohamed FAROUK, Rajesh KUMAR
doaj +1 more source
Left Ventricle Motion Estimation in Cine MRI With Multilayer Iterative Deformable Graph Matching
IEEE Access, 2019 Quantifying regional myocardial motion and deformation from cardiac magnetic resonance imaging (MRI) plays an important role in clinical applications. In this paper, we present a novel approach for the estimation of left ventricle myocardial motion based
Zhengrui Zhang +3 more
doaj +1 more source
Discrete Applied Mathematics, 2023 Quasi-best match graphs (qBMGs) are a hereditary class of directed, properly vertex-colored graphs. They arise naturally in mathematical phylogenetics as a generalization of best match graphs, which formalize the notion of evolutionary closest relatedness of genes (vertices) in multiple species (vertex colors).
Annachiara Korchmaros +3 more
openaire +4 more sources
Research on Service Discovery Methods Based on Knowledge Graph
IEEE Access, 2020 Service discovery is one of the main goals of a service-oriented architecture, helping to discover complex applications. Knowledge graph is a cross-cutting research hotspot in the fields of computer, knowledge engineering and information science.
Li Guodong +3 more
doaj +1 more source