On the number of minimum size separating vertex sets in a graph and how to find all of them.
| Autor: | Kanevsky, Arkady |
|---|---|
| Zdroj: | Proceedings of the First Annual ACM-SIAM Symposium: Discrete Algorithms; 1/1/1990, p411-421, 11p |
| Databáze: | Complementary Index |
| Externí odkaz: |
|