Login / Signup
Dominating induced matchings in S1, 2, 4-free graphs.
Andreas Brandstädt
Raffaele Mosca
Published in:
Discret. Appl. Math. (2020)
Keyphrases
</>
maximum cardinality
series parallel
graph matching
pattern recognition
graph theory
graph theoretical
graph structure
case study
graph mining
neural network
probabilistic model
image segmentation
real time
graph databases
complex structures
graph structures
information systems
real world
structured objects