Results 141 to 150 of about 10,951 (224)

Learning Continuous Decomposable Models Using Mutual Information and Statistical Copulas. [PDF]

open access: yesEntropy (Basel)
Desuó Neto L   +3 more
europepmc   +1 more source

Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs

open access: yesGraph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs
This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs, chordal graphs, comparability graphs, split graphs, and k-trees for unbounded k.
openaire  

Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]

open access: yesJ Stat Theory Pract
Röttger F, Kahle T, Schwabe R.
europepmc   +1 more source

Counting Temporal Paths. [PDF]

open access: yesAlgorithmica
Enright J, Meeks K, Molter H.
europepmc   +1 more source

Orthology and near-cographs in the context of phylogenetic networks. [PDF]

open access: yesAlgorithms Mol Biol
Lindeberg A   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy