Results 41 to 50 of about 10,152,062 (308)
Tapered transmission line technique based graded matching layers for thickness mode piezoelectric transducers [PDF]
, 2009 Conventionally, in order to acoustically match thickness mode piezoelectric transducers to a low acoustic impedance load medium, multiple quarter wavelength (QW) matching layers are employed at the front face of the device.
Ramadas, Sivaram Nishal +6 more
core +3 more sources
Matching Numbers and Dimension of Edge Ideals [PDF]
Graphs and Combinatorics, 2021 Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_{1}, \ldots, x_{n}\}$ and match$(G)$, min-match$(G)$ and ind-match$(G)$ the matching number, minimum matching number and induced matching number of $G$, respectively. Let $K[V(G)] = K[x_{1}, \ldots, x_{n}]$ denote the polynomial ring over a field $K$ and $I(G) \subset K[V(G)]$ the edge ...
Ayana Hirano, Kazunori Matsuda
openaire +4 more sources
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source
图的补距离矩阵谱半径的最大值(On maximal spectral radius of complementary distance matrix of graphs)
Zhejiang Daxue xuebao. Lixue ban, 2013 We determine the graphs with maximal spectral radius of the complementary distance matrix among simple connected graphs with fixed order and matching number and diameter less than or equal to 2.
SULi(苏莉), LIHong-hai(李红海)
doaj +1 more source
当匹配数很小时具有最小拉普拉斯谱半径的树(Trees with small matching number and minimum Laplacian spectral radius)
Zhejiang Daxue xuebao. Lixue ban, 2013 考虑了具有最小拉普拉斯谱半径的树的问题.并确定了当匹配数很小时具有最小拉普拉斯谱半径的树.
LINXi-qin(林西芹) +2 more
doaj +1 more source
Journal of Mathematics, 2022 The matching roots of a simple connected graph G are the roots of the matching polynomial which is defined as MGx=∑k=0n/2−1kmG,kxn−2k, where mG,k is the number of the k matchings of G. Let λ1G denote the largest matching root of the graph G.
Luozhong Gong, Weijun Liu
doaj +1 more source
LOCK-FREE MULTITHREADED SEMI-GLOBAL MATCHING WITH AN ARBITRARY NUMBER OF PATH DIRECTIONS [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 This paper describes an efficient implementation of the semi-global matching (SGM) algorithm on multi-core processors that allows a nearly arbitrary number of path directions for the cost aggregation stage.
D. Frommholz
doaj +1 more source
On Indeterminate Strings Matching [PDF]
, 2020 Given two indeterminate equal-length strings p and t with a set of characters per position in both strings, we obtain a determinate string p_w from p and a determinate string t_w from t by choosing one character per position.
Landau, Gad M. +2 more
core +1 more source
On the Independence Number of Traceable 2-Connected Claw-Free Graphs
Discussiones Mathematicae Graph Theory, 2019 A well-known theorem by Chvátal-Erdőos [A note on Hamilton circuits, Discrete Math. 2 (1972) 111–135] states that if the independence number of a graph G is at most its connectivity plus one, then G is traceable.
Wang Shipeng, Xiong Liming
doaj +1 more source
OE Matching Algorithm for Searching Biological Sequences [PDF]
, 2009 String matching algorithms play a key role in many computer science problems, and in the implementation of computer software. This problem has received, and continues to receive a great deal of attention due to various applications in text ...
Osborne, Hugh, Klaib, Ahmad
core +5 more sources