Buscar
Mostrando ítems 1-10 de 22
Forbidden vertices
(2015)
Forbidden Vertices
(2015)
BOOLES CONDITIONS OF POSSIBLE EXPERIENCE AND REASONING UNDER UNCERTAINTY
(Elsevier Science BvAmsterdamHolanda, 1995)
Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
(Discrete Mathematics And Theoretical Computer Science, 2013-01)
A biclique is a set of vertices that induce a complete bipartite graph. A graph G is biclique-Helly when its family of maximal bicliques satisfies the Helly property. If every induced subgraph of G is also biclique-Helly, ...
On bubble generators in directed graphs
(Bodlaender, Hans L., Woeginger, Gerhard J., 2017)
Bubbles are pairs of internally vertex-disjoint (s, t)-paths with applications in the processing of DNA and RNA data. For example, enumerating alternative splicing events in a reference-free context can be done by enumerating ...
On Bubble Generators in Directed Graphs
(2017)
Bubbles are pairs of internally vertex-disjoint (s, t)-paths
with applications in the processing of DNA and RNA data. For example,
enumerating alternative splicing events in a reference-free context
can be done by enumerating ...
Propriedades físicas de modelos integráveis
(Universidade Federal de São CarlosUFSCarPrograma de Pós-Graduação em Física - PPGFCâmpus São Carlos, 2017-08-16)
In this thesis we tackled two di erent problems of quantum integrability. We derived nite sets of non-linear integral equations to describe physical properties of quantum chains invariant under the super-algebras su(2|1) ...
On bubble generators in directed graphs
(Springer, 2017)
Bubbles are pairs of internally vertex-disjoint (s, t)-paths with applications in the processing of DNA and RNA data. For example, enumerating alternative splicing events in a reference-free context can be done by enumerating ...