Journal of Graph TheoryL. Penso, D. Rautenbach, and U. Souza. Graphs in which some and every maximum matching is uniquely restricted. arXiv, 1504.02250, 2015.Lucia Draque Penso, Dieter Rautenbach, and Ueverton dos Santos Souza. Graphs in which some and every maximum matching is uniquely ...
maximum matching numbertight lower bounds/ A0210 Algebra, set theory, and graph theory B0250 Combinatorial mathematics C1160 Combinatorial mathematicsIn this paper we study tight lower bounds on the size of a maximum matching in a regular graph. For k ges 3, let G be a connected k-regular ...
Berge, C.: Two theorems in graph theory. Proceedings of the National Academy of Sciences of the United States of America 43(9), 842–844 (1957) CrossRef Czygrinow, A., Hanckowiak, M.: Distributed algorithm for better approximation of the maximum matching. In: Warnow, T.J., Zhu,...
A matching M in a graph G = (V, E) is a set of vertex disjoint edges. The problem of computing a matching of maximum size is central to the theory of algorithms and has been subject to intense study. Edmond’s landmark paper [3] gave the first polynomial time algorithm for the ...
In this paper, motivated by themaximal matchingand optimal matching in graph theory, a novel approach is proposed for video clip retrieval based on matching theory. 在镜头检索阶段,利用相机运动信息,一个变化较大的镜头被划分为几个内容一致的子镜头,两个镜头的相似性通过对应子镜头的相似性计算得到;在片...
West, D. B.Introduction to Graph Theory, 2nd ed.Englewood Cliffs, NJ: Prentice-Hall, pp. 127-130, 2000. Zwick, U. "Lecture Notes on: Maximum Matching in Bipartite and Non-Bipartite Graphs."http://www.cs.tau.ac.il/~zwick/grad-algo-0910/match.pdf. 2009. ...
Two theorems in graph theory Proc. Natl. Acad. Sci. USA (1957) B.V. Cherkassky et al. Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms J. Exp. Algorithmics (1998) I.S. Duff On algorithms for obtaining a maximum transversal ACM Trans. Math....
In this paper, motivated by the maximal matching and optimal matching in graph theory, a novel approach is proposed for video clip retrieval based on matching theory. 针对问题(2),考虑了片段相似性判断的视觉、粒度、顺序和干扰因子,提出用最优匹配的Kuhn-Munkres算法和动态规划算法相结合,来解决片段相...
For a graph G, let im(G) denote the size of a largest induced matching in G. It is known [22], [7] that given a graph G and integer k, deciding whether im(G)≥k is NP-complete even when G is bipartite. However, for several restricted families of graphs, this problem has been...
in the communication with one of its neighbors by means of interfacei, then another neighboring node ofxcan establish a connection (but not withx) only if it makes use of interfacej ≠ i. The size of a solution for an instance of the outcoming matching problem, that we callMaximum ...