Modelirovanie i Analiz Informatsionnykh Sistem
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


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
References:
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
Document Type: Article
UDC: 519.1
Language: Russian
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
Citation in format AMSBIB
\Bibitem{AntBon12}
\by A.~I.~Antonov, V.~A.~Bondarenko
\paper Polyhedral Graphs of GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH Problems
\jour Model. Anal. Inform. Sist.
\yr 2012
\vol 19
\issue 6
\pages 101--106
\mathnet{http://mi.mathnet.ru/mais274}
Linking options:
  • https://www.mathnet.ru/eng/mais274
  • https://www.mathnet.ru/eng/mais/v19/i6/p101
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Моделирование и анализ информационных систем
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024