A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges.
Katarzyna PaluchMateusz WasylkiewiczPublished in: Inf. Process. Lett. (2021)
Keyphrases
- learning algorithm
- dynamic programming
- worst case
- matching algorithm
- optimization algorithm
- optimal solution
- preprocessing
- k means
- significant improvement
- graph isomorphism
- undirected graph
- spanning tree
- directed graph
- detection algorithm
- random walk
- expectation maximization
- experimental evaluation
- np hard
- search space
- graph partitioning
- random graphs
- edge detection algorithm
- lower bound