Results 11 to 20 of about 4,122,423 (255)
On Distance-3 Matchings and Induced Matchings
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Brandstadt, MOSCA, Raffaele
openaire +3 more sources
Some Results on Dominating Induced Matchings
Graphs and Combinatorics, 2022 Let $G$ be a graph, a dominating induced matching (DIM) of $G$ is an induced matching that dominates every edge of $G$. In this paper we show that if a graph $G$ has a DIM, then $χ(G) \leqslant 3$. Also, it is shown that if $G$ is a connected graph whose all edges can be partitioned into DIM, then $G$ is either a regular graph or a biregular graph and ...
Saieed Akbari +4 more
openaire +5 more sources
Spatiotemporal phase-matching in capillary high-harmonic generation [PDF]
, 2012 We present a simple phase-matching model that takes into account the full spatiotemporal nature of capillary high-harmonic generation. Spectra predicted from the model are compared to experimental results for a number of gases and are shown to reproduce ...
Rogers, Edward T.F. +22 more
core +1 more source
Maximum induced matchings close to maximum matchings
Theoretical Computer Science, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Márcio Antônio Duarte +4 more
openaire +3 more sources
Locally searching for large induced matchings [PDF]
Theoretical Computer Science, 2018 It is an easy observation that a natural greedy approach yields a $\left(d-O(1)\right)$-factor approximation algorithm for the maximum induced matching problem in $d$-regular graphs. The only considerable and non-trivial improvement of this approximation ratio was obtained by Gotthilf and Lewenstein using a combination of the greedy approach and local ...
Maximilian Fürst +2 more
openaire +3 more sources
Maximum induced matchings in graphs
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiping Liu, Huishan Zhou
openaire +2 more sources
, 2011 This article introduces the quantitative analysis of choice behavior by describing a number of equations developed over the years to describe the relation between the allocation of behavior under concurrent schedules of reinforcement and the consequences
Timothy L. Edwards +7 more
core +1 more source
Induced matchings in bipartite graphs
Discrete Mathematics, 1989 All the graphs in this paper are understood to be finite, undirected, without loops or multiple edges. An induced \((k+1)\)-matching of the graph G is an induced subgraph that consists of \(k+1\) independent edges of G. The authors prove several extremal results of this concept.
Ralph J. Faudree +3 more
openaire +2 more sources
Discrete Applied Mathematics, 1989 An induced matching of a graph G is a vertex induced subgraph of G that is a matching. The author shows that the following decision problem is NP-complete: For a given bipartite graph G and positive integer k, is there an induced matching of size at least k? So the problem of finding a largest induced matching for bipartite graphs is Np-hard.
openaire +1 more source
A memetic fingerprint matching algorithm [PDF]
, 2007 Minutiae point pattern matching is the most common approach for fingerprint verification. Although many minutiae point pattern matching algorithms have been proposed, reliable automatic fingerprint verification remains as a challenging problem, both with
Howells, Gareth +3 more
core +1 more source