Abstract: In this paper we study the complexity of bounded color multiplicity graph isomorphism BCGI/sub b/: the input is a pair of vertex-colored graphs such that the number of vertices of a given ...

Department of Mathematics, Qinghai Nationalities University, Xining, China. Case 1: Both of m, n are even. The authors would like to thank anonymous reviewers for their valuable comments and suggests ...

Abstract: A graph can be exactly specified by the spectrum and corresponding eigenvectors of its adjacency matrix. This provides a solid foundation for spectrum based graph matching. However, most ...

In machine learning, models are designed to detect patterns from data, enabling tasks like image recognition and financial forecasting. Despite similar performance metrics, different models can yield ...

The linear contig: Why is it linear? Is it actually a linear plasmid or is an incompletely-assembled sequence? The eight-contig-loop: Is it a one or more separate circular sequences - plasmids maybe?