Searching for "Induced matchings." – sorted by Relevance.
-
On Induced Matchings
- scaling, rotation or translation of the image. In this experiment, we use it to match two faces. Feature
- Cited by 5 (0 self) – Add To MetaCart
-
On the Induced Matching Problem
- On the Induced Matching Problem Iyad Kanj ∗ Michael J. Pelsmajer † Marcus Schaefer ‡ Ge Xia
- Cited by 2 (0 self) – Add To MetaCart
-
Induced matchings and induced paths in graphs
- INDUCED MATCHINGS AND INDUCED PATHS IN GRAPHS JAROSLAV NEˇSETˇRIL AND PATRICE OSSONA DE MENDEZ
- Cited by 1 (0 self) – Add To MetaCart
-
Induced matchings and induced paths in graphs
- INDUCED MATCHINGS AND INDUCED PATHS IN GRAPHS JAROSLAV NEˇSETˇRIL AND PATRICE OSSONA DE MENDEZ
- Add To MetaCart
-
Induced Matchings in Regular Graphs and Trees
- Induced Matchings in Regular Graphs and Trees Michele Zito ? Department of Computer Science
- Cited by 8 (2 self) – Add To MetaCart
-
On the approximability of the maximum induced matching problem
- / Glasgow ePrints Service http://eprints.gla.ac.uk On the Approximability of the Maximum Induced Matching
- Cited by 16 (2 self) – Add To MetaCart
-
Maximum Induced Matchings of Random Cubic Graphs
- Maximum Induced Matchings of Random Cubic Graphs William Duckworth 1 , Nicholas C. Wormald 1
- Add To MetaCart
-
Maximum Induced Matchings of Random Cubic Graphs
- Maximum Induced Matchings of Random Cubic Graphs W. Duckworth 1y , N.C. Wormald 1z and M
- Cited by 5 (1 self) – Add To MetaCart
-
Maximum Induced Matchings of Random Cubic Graphs
- Maximum Induced Matchings of Random Cubic Graphs W. Duckworth 1y , N.C. Wormald 1z and M
- Add To MetaCart
-
The parameterized complexity of the induced matching problem in planar graphs
- The Parameterized Complexity of the Induced Matching Problem 2,3 Hannes Moser 1,∗ Institut für
- Cited by 3 (0 self) – Add To MetaCart

