|
seams-core v2.14.0
libyodaLib, the C++ engine of d-SEAMS
|
Proof that the reported number of equatorial rings is maximum. More...
#include <src/include/internal/topo_bulk.hpp>
Public Attributes | |
| int | cages = 0 |
| int | upper = -1 |
| int | matching = 0 |
| int | cover = 0 |
| int | isolates = 0 |
| int | vertices = 0 |
| int | edges = 0 |
| int | components = 0 |
| int | dropped = 0 |
| int | method = 0 |
| bool | tight = false |
| double | milliseconds = 0 |
Proof that the reported number of equatorial rings is maximum.
method 1: the mutual-conflict graph is the line graph of a bipartite graph, and a matching equals a König cover. method 2: each connected component was solved by branch-and-bound. The cover is a clique partition (an upper bound). When it equals the set, that partition is the certificate; otherwise the exhausted search is.
Definition at line 152 of file topo_bulk.hpp.
| int ring::PackingCertificate::cages = 0 |
Definition at line 153 of file topo_bulk.hpp.
| int ring::PackingCertificate::components = 0 |
Definition at line 160 of file topo_bulk.hpp.
| int ring::PackingCertificate::cover = 0 |
Definition at line 156 of file topo_bulk.hpp.
| int ring::PackingCertificate::dropped = 0 |
Definition at line 161 of file topo_bulk.hpp.
| int ring::PackingCertificate::edges = 0 |
Definition at line 159 of file topo_bulk.hpp.
| int ring::PackingCertificate::isolates = 0 |
Definition at line 157 of file topo_bulk.hpp.
| int ring::PackingCertificate::matching = 0 |
Definition at line 155 of file topo_bulk.hpp.
| int ring::PackingCertificate::method = 0 |
Definition at line 162 of file topo_bulk.hpp.
| double ring::PackingCertificate::milliseconds = 0 |
Definition at line 164 of file topo_bulk.hpp.
| bool ring::PackingCertificate::tight = false |
Definition at line 163 of file topo_bulk.hpp.
| int ring::PackingCertificate::upper = -1 |
Definition at line 154 of file topo_bulk.hpp.
| int ring::PackingCertificate::vertices = 0 |
Definition at line 158 of file topo_bulk.hpp.