Results 1 to 10 of about 266,730 (262)
On the induced matching problem
Journal of Computer and System Sciences, 2011 We study extremal questions on induced matchings in several natural graph classes. We argue that these questions should be asked for twinless graphs, that is graphs not containing two vertices with the same neighborhood. We show that planar twinless graphs always contain an induced matching of size at least $n/40$ while there are planar twinless graphs
Marcus Schaefer, Iyad Kanj, Ge Xia
exaly +7 more sources
On the approximability of the maximum induced matching problem [PDF]
Journal of Discrete Algorithms, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Manlove, Michele Zito
exaly +3 more sources
The graphs with maximum induced matching and maximum matching the same size
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kathie Cameron
exaly +2 more sources
Phase-matching free pulse retrieval based on plasma-induced defocusing [PDF]
EPJ Web of Conferences, 2023 A phase-matching free pulse retrieval technique based on plasma-induced defocusing in a rare gas is presented. Based on a pump-probe setup, this technique uses a moderately intense pump laser pulse for ionizing the medium, creating in turn an ultrafast ...
Béjot Pierre +4 more
doaj +1 more source
Strong chromatic index of products of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Graphs and ...
Olivier Togni
doaj +1 more source
Matching book thickness of generalized Petersen graphs
Electronic Journal of Graph Theory and Applications, 2022 The matching book embedding of a graph G is to place its vertices on the spine, and arrange its edges on the pages so that the edges in the same page do not intersect each other and the edges induced subgraphs of each page are 1-regular.
Zeling Shao, Huiru Geng, Zhiguo Li
doaj +1 more source
Antimatroids induced by matchings [PDF]
Discrete Applied Mathematics, 2019 We explore novel connections between antimatroids and matchings in bipartite graphs. In particular, we prove that a combinatorial structure induced by stable matchings or maximum-weight matchings is an antimatroid. Moreover, we demonstrate that every antimatroid admits such a representation by stable matchings and maximum-weight matchings.
Yasushi Kawase, Yutaro Yamaguchi 0001
openaire +3 more sources
Large Induced Matchings in Random Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2021 Given a large graph $H$, does the binomial random graph $G(n,p)$ contain a copy of $H$ as an induced subgraph with high probability? This classical question has been studied extensively for various graphs $H$, going back to the study of the independence number of $G(n,p)$ by Erdős and Bollobás, and Matula in 1976.
Oliver Cooley +3 more
openaire +3 more sources
A faster algorithm for maximum independent set on interval filament graphs
Journal of Graph Algorithms and Applications, 2022 We provide an algorithm requiring only $O(N^2)$ time to compute the maximum weight independent set in an $N$-vertex interval filament graph. This implies an $O(N^4)$-time algorithm to compute the maximum weight induced matching in such graphs.
Darcy Best, Max Ward
doaj +1 more source
On price-induced minmax matchings
CoRR, 2023 We study a natural combinatorial pricing problem for sequentially arriving buyers with equal budgets. Each buyer is interested in exactly one pair of items and purchases this pair if and only if, upon arrival, both items are still available and the sum of the item prices does not exceed the budget.
Christoph Dürr +2 more
openaire +2 more sources