Trudy Instituta Matematiki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Proceedings of the Institute of Mathematics of the NAS of Belarus:
Year:
Volume:
Issue:
Page:
Find




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

Trudy Instituta Matematiki, 2012, Volume 20, Number 1, Pages 60–73 (Mi timb163)  
This article is cited in 1 scientific paper (total in 1 paper)

Computation of the biclique partition number for graphs with specific blocks

V. V. Lepin, O. I. Duginov

Institute of Mathematics of the National Academy of Sciences of Belarus
Full-text PDF (239 kB) Citations (1)
References:
PDF
HTML
Abstract: The biclique partition number of an undirected graph $G=(V,E)$ is the smallest number of bicliques (complete bipartite subgraphs) of the graph $G$ needed to partition the edge set $E.$ We present an efficient algorithm for finding the biclique partition number of a connected graph whose blocks are either complete graphs or complete bipartite graphs or cycles.
Received: 30.12.2011
Document Type: Article
UDC: 519.1
Language: Russian
Citation: V. V. Lepin, O. I. Duginov, “Computation of the biclique partition number for graphs with specific blocks”, Tr. Inst. Mat., 20:1 (2012), 60–73
Citation in format AMSBIB
\Bibitem{LepDug12}
\by V.~V.~Lepin, O.~I.~Duginov
\paper Computation of the biclique partition number for graphs with specific blocks
\jour Tr. Inst. Mat.
\yr 2012
\vol 20
\issue 1
\pages 60--73
\mathnet{http://mi.mathnet.ru/timb163}
Linking options:
  • https://www.mathnet.ru/eng/timb163
  • https://www.mathnet.ru/eng/timb/v20/i1/p60
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Труды Института математики
    Statistics & downloads:
    Abstract page:299
    Full-text PDF :212
    References:34
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024