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
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time constraints on the query and on a possible preprocessing of the set family make this problem challenging. Such max...
,Δ(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...
The paper surveys the techniques used for designing the most efficient algorithms for finding a maximal (cardinality or weighted) matching in (general or b... Z Galil - ACM 被引量: 499发表: 1986年 Generalized subgraph-restricted matchings in graphs For a graph property P, we define a P-mat...
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 ...
This is a quadratic set of equations, obtained by matching coefficients of products of D's. Since we are interested in integrals that can be used to express the form factor in, more constraints can be added to the problem for specific purposes. For instance, the constraint can be added ...
Maximal matching and edge domination in complete multipartite graphs - Zhao, Miao, et al. - 2013 () Citation Context ...s in graphs have been subject of many studies in graph theory, and have many applications in operations research, resource allocation and network routing, as well as in ...
Theorem 1.3 then states that G[F] induces a graph consisting of a matching together with possibly some isolates, where all vertices isolated in M are also isolated in G[F]. This conclusion is not difficult to prove directly, as the maximality of M implies that the only G-edges among the...
In these examples, it is simple to check which subgraphs are maximal cliques. However, in real matching tasks it can quickly become unmanageable. (The reader is encouraged to draw the match graph for an image containing two objects of seven points!) Figure 15.8 shows what is perhaps the most...
A membrane structure can be described in various ways, for instance by a string of matching parentheses, where each pair identifies a specific membrane. another way of describing such a structure is by means of a tree graph; the height of this tree is called the depth of the corresponding ...