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...
An induced matching in a graph is a set of edges whose endpoints induce a 1-regular subgraph. It is known that every graph on n vertices has at most 10n/5≈1.5849n maximal induced matchings, and this bound is the best possible as any disjoint union of complete graphs K5 forms an extr...
Hoffmann, B., Lifshits, Y., Nowotka, D. (2007). Maximal Intersection Queries in Randomized Graph Models. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds) Computer Science – Theory and Applications. CSR 2007. Lecture Notes in Computer Science, vol 4649. Springer, Berlin, Heidelberg...
We consider the minimum maximal matching problem, which is NP -hard (Yannakakis and Gavril (1980) [18]). Given an unweighted simple graph G = ( V , E ) , the problem seeks to find a maximal matching of minimum cardinality. It was unknown whether there exists a non-trivial ...
The time complexity of maximum matching by simulated annealing The random, heuristic search algorithm called simulated annealing is considered for the problem of finding the maximum cardinality matching in a graph. It ... GH Sasaki,B Hajek - 《Journal of the Acm》 被引量: 279发表: 1988年 Perf...
In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp. 302–311 (1984) Goldberg, A.V.: Efficient graph algorithms for sequential and parallel computers. Doctoral dissertation, Massachusetts Institute of Technology (1987) Dalkılıç, O.: A decision-making approach...
,Δ(G)} in which two distinct vertices i and j are adjacent exactly if G contains an edge between Ni2 and Nj2. Since no vertex of G lies on more than s cycles of length 7, the graph H has no matching with more than s edges. This implies that H has an independent set of order...
Thus, this work can be interpreted as a generalization of the study of these complexes. We provide a detailed investigation when our poset is a product of chains, in which case we find an optimal discrete Morse matching and prove that the corresponding complex is torsion-free. 展开 ...
In subject area: Computer Science A Maximal Independent Set refers to a set of vertices in a graph where no other vertex can be added while still maintaining the property of being pairwise nonadjacent. AI generated definition based on: Fundamentals of the Theory of Computation: Principles and ...
Sinceadaptive non-maximal suppressioneliminated lots of potential matching points,condition theory was applied to control the number of initial interest points. 针对自适应非极大值抑制排除了大量潜在匹配点的缺陷,引入条件理论对初始兴趣点进行控制,排除病态点,减少后续过程的计算量,提高算法效率,同时最大限度的保...