Results 101 to 110 of about 2,022 (201)

Brauer and partition diagram models for phylogenetic trees and forests. [PDF]

Proc Math Phys Eng Sci, 2022
Francis A, Jarvis PD.
europepmc   +1 more source

On Hamiltonian Decomposition Problem of 3-Arc Graphs. [PDF]

Comput Intell Neurosci, 2022
Xu G, Sun Q, Liang Z.
europepmc   +1 more source

Anti-Kekulé number of the {(3, 4), 4}-fullerene. [PDF]

Front Chem, 2023
Yang R, Jia H.
europepmc   +1 more source

Discrepancies of perfect matchings in hypergraphs

In this paper, we determine the minimum degree threshold of perfect matchings with high discrepancy in $r$-edge-colored $k$-uniform hypergraphs for all $k\geq 3$ and $r\geq 2$, thereby completing the investigation into discrepancies of perfect matchings ...
Xie, Shengjie, Lu, Hongliang, Ma, Jie
core  

Perfect matchings in random r-regular, s-uniform hypergraphs

, 1996
original source http://www.cambridge.org/journals/journal_catalogue.asp?mnemonic=CPCWe show that r-regular, s-uniform hypergraphs contain a perfect matching with high probability (whp), provided s > 1 + log r / (r-1)log(r/(r-1)) .
Frieze, A., Reed, B., Molloy, M., Cooper, C.   +3 more
core   +1 more source

Topological Engineering of Chiral Anomalies in Janus Nanoribbons. [PDF]

Nano Lett
Saroka VA, Demin VA, Pizzochero M.
europepmc   +1 more source

Approximately Counting Perfect and General Matchings in Bipartite and General Graphs

, 2009
We develop algorithms to approximately count perfect matchings in bipartite graphs (or permanents of the corresponding adjacency matrices), perfect matchings in nonbipartite graphs (or hafnians), and general matchings in bipartite and nonbipartite graphs
Law, Wai Jing
core  

Efficient classical sampling from Gaussian boson sampling distributions on unweighted graphs. [PDF]

Nat Commun
Zhang Y, Zhou S, Wang X, Wang Z, Yang Z, Yang R, Xue Y, Li T.   +7 more
europepmc   +1 more source

Reference-based cell type matching of in situ image-based spatial transcriptomics data on primary visual cortex of mouse brain. [PDF]

Sci Rep, 2023
Zhang Y, Miller JA, Park J, Lelieveldt BP, Long B, Abdelaal T, Aevermann BD, Biancalani T, Comiter C, Dzyubachyk O, Eggermont J, Langseth CM, Petukhov V, Scalia G, Vaishnav ED, Zhao Y, Lein ES, Scheuermann RH.   +17 more
europepmc   +1 more source

Finding All The Perfect Matchings in Bipartite Graphs

, 1989
This paper describes an algorithm for finding all the perfect matchings in a bipartite graph. By using the binary partitioning method, our algorithm requires O(c(n +m)+ n 2:5 ) computational effort and O(nm) memory storage, (where n denotes the number ...
Komei Fukuda, Tomomi Matsui
core