Pages that link to "Item:Q987840"
From MaRDI portal
The following pages link to An algorithm for computing simple \(k\)-factors (Q987840):
Displaying 6 items.
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- A Simple and Improved Algorithm for Integer Factorization with Implicit Hints (Q2790046) (← links)
- (Q2999660) (← links)
- Construction of k-matchings in graph products (Q5058206) (← links)
- Hamilton cycles in bidirected complete graphs (Q5061404) (← links)
- Minimum reload cost graph factors (Q5918369) (← links)