A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges.
Katarzyna PaluchMateusz WasylkiewiczPublished in: CoRR (2020)
Keyphrases
- cost function
- search space
- significant improvement
- preprocessing
- graph partitioning
- segmentation algorithm
- probabilistic model
- spanning tree
- graph model
- tree structure
- neural network
- graph isomorphism
- worst case
- experimental evaluation
- np hard
- optimal solution
- random walk
- polynomial time complexity
- graph clustering
- minimum spanning tree
- maximum cardinality
- weighted graph
- convergence rate
- directed graph
- expectation maximization
- dynamic programming
- objective function