Results 91 to 100 of about 3,632 (158)

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  

NAP: The Network Analysis Profiler, a web tool for easier topological analysis and comparison of medium-scale biological networks. [PDF]

open access: yesBMC Res Notes, 2017
Theodosiou T   +6 more
europepmc   +1 more source

Acyclic and star coloring parameters of fractal cubic networks. [PDF]

open access: yesSci Rep
Renuga C   +3 more
europepmc   +1 more source

Reconfiguring Shortest Paths in Graphs. [PDF]

open access: yesAlgorithmica
Gajjar K, Jha AV, Kumar M, Lahiri A.
europepmc   +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

Home - About - Disclaimer - Privacy