Zobrazeno 1 - 10
of 116
pro vyhledávání: '"bidirected graph"'
Autor:
Santosa Faizhal Arif
Publikováno v:
Open Information Science, Vol 7, Iss 1, Pp 959-975 (2023)
Bibliometric mapping offers easiness in analyzing the relationship between publications through the network visuals created. Several applications, such as VOSviewer, Bibliometrix, and CiteSpace, make conducting network analysis more convenient. Moreo
Externí odkaz:
https://doaj.org/article/e77d1c9b903546c78c5d53778885c318
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 3, Pp 727-746 (2022)
A nowhere-zero unoriented flow of graph G is an assignment of non-zero real numbers to the edges of G such that the sum of the values of all edges incident with each vertex is zero. Let k be a natural number. A nowhere-zero unoriented k-flow is a flo
Externí odkaz:
https://doaj.org/article/60543048be424920a1404efea13732fb
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.
Autor:
Akhmedov, Maxim, Babenko, Maxim
Let $G$ be an undirected network with a distinguished set of terminals $T \subseteq V(G)$ and edge capacities $cap: E(G) \rightarrow \mathbb{R}_+$. By an odd $T$-walk we mean a walk in $G$ (with possible vertex and edge self-intersections) connecting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::355fea2289ce89f56cf43333992e00c0
http://arxiv.org/abs/2303.00827
http://arxiv.org/abs/2303.00827
Autor:
Paul Medvedev, Amatur Rahman
Publikováno v:
Journal of Computational Biology. 28:381-394
Given the popularity and elegance of k-mer based tools, finding a space-efficient way to represent a set of k-mers is important for improving the scalability of bioinformatics analyses. One popular approach is to convert the set of k-mers into the mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cda3eccc1396d91f4a5ea9e9d3577e47
https://doi.org/10.1089/cmb.2020.0431
https://doi.org/10.1089/cmb.2020.0431
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.
Autor:
Nanao Kita
Publikováno v:
Discrete Applied Mathematics. 284:61-70
This paper is the first from a series of papers that establish a common analogue of the strong component and basilica decompositions for bidirected graphs. A bidirected graph is a graph in which a sign ＋ or − is assigned to each end of each edge,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47e53033136f371778768b1d6811e407
https://doi.org/10.1016/j.dam.2020.03.022
https://doi.org/10.1016/j.dam.2020.03.022
Autor:
Drton, Mathias, Richardson, Thomas S.
Publikováno v:
Journal of the Royal Statistical Society. Series B (Statistical Methodology), 2008 Jan 01. 70(2), 287-309.
Externí odkaz:
https://www.jstor.org/stable/20203826
Autor:
Drton, Mathias, Perlman, Michael D.
Publikováno v:
Statistical Science, 2007 Aug 01. 22(3), 430-449.
Externí odkaz:
https://www.jstor.org/stable/27645848