Given an undirected graph G = ( V, E), we seek a minimum weight subset of E which is a matching and which is maximal in this regard. Known as minimum-maximal matching, this problem is hard in general but can be solved in linear time if G is series-parallel. After a brief back...
Given an undirected graph G = ( V, E), we seek a minimum weight subset of E which is a matching and which is maximal in this regard. Known as minimum-maximal matching, this problem is hard in general but can be solved in linear time if G is series-parallel. After a brief backgrou...
Maximal Induced Matchings in Triangle-Free Graphs An induced matching in a graph is a set of edges whose endpoints induce a 1-regular subgraph. It is known that every n-vertex graph has at most 10... M Basavaraju,P Heggernes,PV′ Hof,... - 《Journal of Graph Theory》 被引量: 6发...
摘要: On a network having m edges and n nodes, Hsu and Huang's self-stabilizing algorithm for maximal matching stabilizes in at most 2 m+ n moves.关键词: Theoretical or Mathematical/ computational complexity graph theory pattern matching self-adjusting systems/ maximal matching stabilization self-...
Abstract Pattern Matching Techniques E.R.DAVIES, inMachine Vision (Third Edition), 2005 15.7Search We have shown how themaximal cliqueapproach may be used to locate objects in an image, or alternatively to label scenes according topredefined rulesabout what arrangements of regions are expected in ...
Clique partitions of the cocktail party graph Let T v denote the complenent of a perfect matching in the complete graph on v vertices, v even, and let cp(T v) be the minimum number of cliques needed to partition the edge-set of T v. We prove that cp(T v) v for v 8 and give...
On the maximal signless Laplacian spectral radius of graphs with given matching number Summary: Let $\\cal{G}_{n,β}$ be the set of simple graphs of order $n$ with given matching number $β$. In this paper, we investigate the maximal signless... G Yu - 《Proceedings of the Japan...
2. Tight lower bounds on the matching number in a graph with given maximum degree [J] . Henning Michael A., Yeo Anders Journal of Graph Theory . 2018,第1a2期 机译:在具有最大程度的图表中匹配数量的匹配数量紧密 3. Tighter Bounds on the Size of a Maximum P 3-Matching in a Cubic...
Karp 9] showed that determining whether or not there exist node disjoint paths for a set of pair of points in a graph is an NP-complete problem. Shiloach 15] presented a polynomial time algorithm to construct 1 node disjoint paths in a graph for two pair of points and Watkin 16] showed...
Extensive numerical results that we obtain are rather closely supportive of this hypothesis. Both the real and complex estimated EPSFs exhibit clearly pronounced jumps of magnitude roughly 50% at , as well as a number of additional matching discontinuities. 展开 ...