نتایج جستجو برای: field edge matching
تعداد نتایج: 978531 فیلتر نتایج به سال:
A rainbow matching in an edge-colored graph is a matching whose edges have distinct colors. We address the complexity issue of the following problem, max rainbow matching: Given an edge-colored graph G, how large is the largest rainbow matching in G? We present several sharp contrasts in the complexity of this problem. We show, among others, that • max rainbow matching can be approximated by a ...
A novel image matching algorithm is presented in this paper. One significant property of this algorithm is: free of large non-linear scale difference and orientation difference between left and right. The algorithm tries to match every pixel in the image pair to provide a very detailed matched point set for generating a very good quality DEM. The matching approach, which combines feature based ...
Symmetric edge polytopes \(\mathcal{A}_G\) of type A are lattice arising from the root system \(A_n\) and finite simple graphs \(G\). There is a connection between Kuramoto synchronization model in physics. In particular, normalized volume plays central role. present paper, we focus on particular class graphs. fact, for any cactus graph \(G\), give formula \(h^*\)-polynomial \(\mathcal{A}_{\wid...
The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...
Let G be a finite simple graph on the vertex set $$V(G) = \{x_{1}, \ldots , x_{n}\}$$ and match(G), min-match(G) ind-match(G) matching number, minimum number induced of G, respectively. $$K[V(G)] K[x_{1}, x_{n}]$$ denote polynomial ring over field K $$I(G) \subset K[V(G)]$$ edge ideal G. The relationship between these graph-theoretic invariants ring-theoretic quotient K[V(G)]/I(G) has been stud...
Let G = (V,E) be a weighted undirected graph with vertex set V , edge set E and a weight function d. Thus, d(u, v) denotes the weight of any edge (u, v) ∈ E. A matching M ⊆ E is a collection of edges such that every node in V is incident to at most one edge in M . The matching is perfect if every node in V is incident to exactly one edge in M . The cost of the matching is given by ∑ (u,v)∈M d(u...
A recent result due to Ha and Van Tuyl proved that the Castelnuovo-Mumford regularity of the quotient ring $R/I(G)$ is at most matching number of $G$, denoted by match$(G)$. In this paper, we provide a generalization of this result for powers of edge ideals. More precisely, we show that for every graph $G$ and every $sgeq 1$, $${rm reg}( R/ I(G)^{s})leq (2s-1) |E(G)|^{s-1} {rm ma...
The purpose of this paper is to show how the edge histogram descriptor for image that can be efficiently utilized for image matching. Since the edge histogram descriptor recommended for the standard represents only local edge distribution in an image, the matching performance for image retrieval may not be satisfactory. In this paper, to increase the matching performance, we propose to use the ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید