Polyhedral Graphs of GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH Problems

Autor:	A. I. Antonov, V. A. Bondarenko
Jazyk:	English<br />Russian
Rok vydání:	2015
Předmět:	polyhedra of combinatorial problems adjacency of vertices clique number of graph of polyhedron Information technology T58.5-58.64
Zdroj:	Моделирование и анализ информационных систем, Vol 19, Iss 6, Pp 101-106 (2015)
Druh dokumentu:	article
ISSN:	1818-1015 2313-5417
DOI:	10.18255/1818-1015-2012-6-101-106
Popis:	We provide an effective description of graphs of polyhedra for GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH problems. We establish the fact, that the clique number for each of this problems increases exponentially with the dimension of the space.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/10273a786338451da57cd8f6463590f2 Zobrazit plný text záznamu View record in DOAJ