Pregled bibliografske jedinice broj: 829719
Enumeration of the facets of cut polytopes over some highly symmetric graphs
Enumeration of the facets of cut polytopes over some highly symmetric graphs // International transactions in operational research, 23 (2016), 5; 853-860 doi:10.1111/itor.12194 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 829719 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Enumeration of the facets of cut polytopes over some highly symmetric graphs
Autori
Dutour Sikirić, Mathieu ; Deza, Michel
Izvornik
International transactions in operational research (0969-6016) 23
(2016), 5;
853-860
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
enumeration ; graph theory ; polyhedra ; combinatorial optimization
Sažetak
We report here a computation giving the complete list of facets for the cut polytopes over several very symmetric graphs with 15-30 edges, including K8, K(3, 3, 3), K(1, 4, 4), K(5, 5), some other K(l, m), K(1, l, m), Prism7, APrism6, Moebius ladder M(14), Dodecahedron, Heawood and Petersen graphs. For K8, it shows that the huge lists of facets of the cut polytope CUTP8 and cut cone CUT8, given in CR is complete. We also confirm the conjecture that any facet of CUTP8 is adjacent to a triangle facet. The lists of facets for K(1, l, m) with (l, m)=(4, 4), (3, 5), (3, 4) solve problems in quantum information theory.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- Social Science Citation Index (SSCI)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
