On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs.

Felicia Lucke Daniël Paulusma Bernard Ries

Published in: CoRR (2022)

Keyphrases

graph matching
matching algorithm
graph mining
graph theory
graph theoretic
maximum cardinality
graph representation
series parallel
bounded treewidth
subgraph isomorphism
directed graph
social networks
pattern matching
pairwise
planar graphs
adjacency graph
polynomial time complexity
pattern recognition