Uniquely restricted matchings in subcubic graphs.
Maximilian FürstMichael A. HenningDieter RautenbachPublished in: Discret. Appl. Math. (2019)
Keyphrases
- maximum cardinality
- graph theoretic
- series parallel
- graph matching
- graph partitioning
- graph kernels
- graph clustering
- graph databases
- graph theory
- learning algorithm
- weighted graph
- spanning tree
- databases
- bipartite graph
- directed graph
- random graphs
- feature selection
- subgraph isomorphism
- graph theoretical
- information systems
- structured objects
- labeled graphs