Abstract: Parallel algorithms for planar graph isomorphism and several related problems are presented. Two models of parallel computation are considered: the CREW-PRAM model and the two-dimensional ...

Abstract: We give an algorithm that, for every fixed k, decides isomorphism of graphs of rank width at most k in polynomial time. As the rank width of a graph is bounded in terms of its clique width, ...

Data close dataInformation collected in the form of numbers. is very useful. It can help us to answer questions, make decisions and solve problems. Before we can use data it needs to be collected. A ...

Microsoft Graph Explorer is built and developed using node v18. npm test to run tests from the command line for scenarios like parsing metadata and functional explorer tests. npm run lint linting your ...

This repository contains the source code used in our paper titled Yihe Pang, Bin Liu. DisoFLAG: Accurate prediction of protein intrinsic disorder and its functions using graph-based interaction ...