Conference
Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
| Τίτλος: | Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition |
|---|---|
| Συγγραφείς: | Davies-Peck, Peter |
| Πηγή: | ACM Symposium on Principles of Distributed Computing. :371-381 |
| Διαθεσιμότητα: | http://dl.acm.org/doi/10.1145/3796701.3815909 |
| Βάση Δεδομένων: | ACM Full-Text Collection |
καταχωρήστε σχόλιο πρώτοι!