Results 111 to 120 of about 55,028 (193)

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

Poster Sessions

open access: yes
HemaSphere, Volume 10, Issue S1, June 2026.
wiley   +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  

Home - About - Disclaimer - Privacy