Results 171 to 180 of about 946,691 (269)

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  

Counting Temporal Paths. [PDF]

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

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

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

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

10-tough chordal graphs are Hamiltonian [PDF]

open access: yesJ. Comb. Theory B, 2015
A. Kabela, Tomás Kaiser
semanticscholar   +1 more source

Single-cell 3D genome reconstruction in the haploid setting using rigidity theory. [PDF]

open access: yesJ Math Biol
Dewar S   +4 more
europepmc   +1 more source

ChoCo: a Chord Corpus and a Data Transformation Workflow for Musical Harmony Knowledge Graphs. [PDF]

open access: yesSci Data, 2023
de Berardinis J   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy