An Efficient Algorithm for Finding an Adjacency Matching of a Graph
Li Deming
Liu Yanpei
Abstract：An adjacency matching in a graph is a matching that each edge in the graph is matched with an adjacent edge if the edges are not in the adj acency matching inducing a connected spanning subgraph. In this paper, an effici ent algorithm on finding a maximum adjacency matching of a graph is provided.
Keywords：adjacency matching augmenting walk algorithm
Publication Date：1999-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)