A computational comparison of compact MILP formulations for the zero forcing number
Consider a graph where some of its vertices are colored. A colored vertex with a single uncolored neighbor forces that neighbor to become colored. A zero forcing set is a set of colored vertices that forces all vertices to become colored. The zero forcing number is the size of a minimum forcing set....
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2020
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10773/27228 |
| Country: | Portugal |
| Oai: | oai:ria.ua.pt:10773/27228 |