Maximal matchings in graphs with large neighborhoods of independent verticesWe obtain lower bounds on the size of a maximum matching in a graph satisfying the condition | N(X) | s for every independent set X of m vertices, thus generalizing results of Faudree, Gould, Jacobson, and Schelp ...
Long cycle in graphs Hamiltonian cycle 3-connected graph 3-cyclable graph Planar graph 1. Introduction In spite of the significant progress over the last decade in the area of approximation algorithms and hardness results, there has been very little progress in establishing positive or negative resul...
R. Motwani. Expanding Graphs and the Average-case Analysis of Algorithms for Matchings and Related Problems. InProc. 21st Annual ACM Symposium on Theory of Computing, pages 550–561, 1989. Google Scholar Q. C. Nguyen and V. Venkateswaran. Implementations of Goldberg-Tarjan Maximum Flow Algorithm...
We also present a polynomial-delay and polynomial-space enumeration algorithm for this problem. As a variant of this algorithm, we give an algorithm that enumerates k -best maximal matchings that runs in polynomial-delay.Kobayashi, Yasuaki