|
Modelirovanie i Analiz Informatsionnykh Sistem, 2012, Volume 19, Number 6, Pages 101–106
(Mi mais274)
|
|
|
|
Polyhedral Graphs of GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH Problems
A. I. Antonov, V. A. Bondarenko P. G. Demidov Yaroslavl State University
Abstract:
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.
Keywords:
polyhedra of combinatorial problems, adjacency of vertices, clique number of graph of polyhedron.
Received: 17.09.2012
Citation:
A. I. Antonov, V. A. Bondarenko, “Polyhedral Graphs of GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH Problems”, Model. Anal. Inform. Sist., 19:6 (2012), 101–106
Linking options:
https://www.mathnet.ru/eng/mais274 https://www.mathnet.ru/eng/mais/v19/i6/p101
|
Statistics & downloads: |
Abstract page: | 443 | Full-text PDF : | 286 | References: | 107 |
|