نتایج جستجو برای: field edge matching
تعداد نتایج: 978531 فیلتر نتایج به سال:
Given n red and n blue points in general position in the plane, it is well-known that there is a perfect matching formed by non-crossing line segments. We characterize the bichromatic point sets which admit exactly one non-crossing matching. We give several geometric descriptions of such sets, and find an O(n log n) algorithm that checks whether a given bichromatic set has this property.
Katerinis and Tsikopoulos (Graphs. Combin. 12 (1996) 327) give su6cient conditions for a regular bipartite graph to have a perfect matching excluding a set of edges. In this paper, we give a necessary and su6cient condition for a bipartite graph to have an f-factor containing a set of edges and excluding another set of edges and discuss some applications of this condition. In particular, we obt...
An efficient approach to shape matching in digital images is presented. The method, called Weighted Edge Potential Function, is a significant improvement of the EPF similarity measure, which models the image edges as charged elements in order to generate a field of attraction over similarly shaped objects. Experimental results and comparisons demonstrate that WEPF enhances the properties of EPF...
Let G be a cubic graph with a perfect matching. An edge e of G is a forcing edge if it is contained in a unique perfect matching M , and the perfect matching M is called uniquely forced. In this paper, we show that a 3-connected cubic graphwith a uniquely forced perfect matching is generated from K4 via Y → 1-operations, i.e., replacing a vertex by a triangle, and further a cubic graph with a u...
A rainbow subgraph of an edge-colored graph is a subgraph whose edges have distinct colors. The color degree of a vertex v is the number of different colors on edges incident to v. Wang and Li conjectured that for k > 4, every edge-colored graph with minimum color degree at least k contains a rainbow matching of size at least ⌈k/2⌉. We prove the slightly weaker statement that a rainbow matching...
Image feature detection and matching is a fundamental task in image processing and machine vision. In this paper we present novel methods for feature detection and matching. We have used edge points and their accumulated curvature information for feature detection. The detected features are then matched using a new method called “fuzzy-edge based feature matching”. To increase the speed of matc...
Good alignment of the magnetic field line pitch angle with the mode structure of an external resonant magnetic perturbation (RMP) field is shown to induce modulation of the pedestal electron pressure p(e) in high confinement high rotation plasmas at the DIII-D tokamak with a shape similar to ITER, the next step tokamak experiment. This is caused by an edge safety factor q95 resonant enhancement...
An r-edge-coloring of a graph is an assignment of r colors to the edges of the graph. An exactly r-edge-coloring of a graph is an r-edge-coloring of the graph that uses all r colors. A matching of an edge-colored graph is called rainbow matching, if no two edges have the same color in the matching. In this paper, we prove that an exactly r-edge-colored complete graph of order n has a rainbow ma...
A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is presented. It calculates a matching with an edge weight of at least 1 2 of the edge weight of a maximum weighted matching. Its time complexity is O(jEj), with jEj being the number of edges in the graph. This improves over the previously known 1 2-approximation algorithms for maximum weighted matching ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید