The complexity of decomposing a graph into a matching and a bounded linear forest.
Agnijo BanerjeeJoão Pedro MarcianoAdva MondJan PetrJulien PortierPublished in: CoRR (2023)
Keyphrases
- graph matching
- graph structure
- maximum matching
- bounded treewidth
- computational cost
- maximum cardinality
- linear complexity
- graph representation
- graph model
- bipartite graph
- matching algorithm
- pattern matching
- worst case
- connected components
- matching process
- similarity scores
- random walk
- directed graph
- image matching
- keypoints
- computational complexity
- polynomial time complexity
- structured data
- matching scheme
- computer vision
- space complexity
- feature matching
- weighted graph