Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Biclique partitioning"'
Autor:
de Sousa Filho, Gilberto F. a, ⁎, Bulhões, Teobaldo a, Cabral, Lucídio dos Anjos F. a, Ochi, Luiz Satoru b, Protti, Fábio b, Pinheiro, Rian G.S. c
Publikováno v:
In Discrete Applied Mathematics 15 October 2021 301:118-130
Autor:
Luiz Satoru Ochi, Teobaldo Bulhões, Lucídio dos Anjos Formiga Cabral, Fábio Protti, Rian G. S. Pinheiro, Gilberto Farias de Sousa Filho
Publikováno v:
Discrete Applied Mathematics. 301:118-130
Given a bipartite graph G = ( V 1 , V 2 , E ) , a biclique of G is a complete bipartite subgraph of G , and a biclique partitioning of G is a set A ⊆ E such that the bipartite graph G ′ = ( V 1 , V 2 , A ) is a vertex-disjoint union of bicliques.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7feb6afdc2775dd6160ee42779ada8ac
https://doi.org/10.1016/j.dam.2021.05.023
https://doi.org/10.1016/j.dam.2021.05.023
Publikováno v:
In Discrete Optimization 2007 4(3):360-377
Publikováno v:
Discrete Optimization
Discrete Optimization, 2007, 4 (3-4), pp.360-377. ⟨10.1016/j.disopt.2007.09.005⟩
Discrete Optimization, Elsevier, 2007, 4 (3-4), pp.360-377. ⟨10.1016/j.disopt.2007.09.005⟩
Discrete Optimization, 2007, 4 (3-4), pp.360-377. ⟨10.1016/j.disopt.2007.09.005⟩
Discrete Optimization, Elsevier, 2007, 4 (3-4), pp.360-377. ⟨10.1016/j.disopt.2007.09.005⟩
International audience; This paper considers the problem of aggregating several multicast sessions. A multicast session is defined as a subset of clients requiring the same information. Besides, each client can require several multicast sessions. A t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad36febc4ff2e3063dde1da02e1eaf9d
https://doi.org/10.1016/j.disopt.2007.09.005
https://doi.org/10.1016/j.disopt.2007.09.005
Autor:
Meftah, Souhail1,2 (AUTHOR) elebv@nus.edu.sg, Zhang, Shuhao3 (AUTHOR) shuhao_zhang@sutd.edu.sg, Veeravalli, Bharadwaj1 (AUTHOR), Aung, Khin Mi Mi2 (AUTHOR)
Publikováno v:
Algorithms. Jun2022, Vol. 15 Issue 6, p183. 20p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Propositional logic has been recognized throughout the centuries as one of the cornerstones of reasoning in philosophy and mathematics. Over time, its formalization into Boolean algebra was accompanied by the recognition that a wide range of combinat
A collection of papers on various theoretical and practical aspects of SAT solving. It is suitable for students and researchers.