( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3.

, , и . CoRR, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Murali Krishna Bollepalli

Aarthi Murali

Murali Sukumaran

Kota Murali

NULL Murali Dama

 

Другие публикации лиц с тем же именем

On the Parallel Parameterized Complexity of the Graph Isomorphism Problem., , и . CoRR, (2017)Evolution of Physics Sub-fields., , и . COMPLEXIS, стр. 88-95. SCITEPRESS, (2020)Convex Isolating Clustering Centrality to Discover the Influential Nodes in Large Scale Networks., , , и . IEEE Access, (2024)On NC algorithms for problems on bounded rank-width graphs., , , и . Inf. Process. Lett., (2018)ICDC: Ranking Influential Nodes in Complex Networks Based on Isolating and Clustering Coefficient Centrality Measures., , , и . IEEE Access, (2023)Node Significance Analysis in Complex Networks Using Machine Learning and Centrality Measures., , , , и . IEEE Access, (2024)Generalization of Relative Change in a Centrality Measure to Identify Vital Nodes in Complex Networks., , , , и . IEEE Access, (2023)Community-Based Matrix Factorization (CBMF) Approach for Enhancing Quality of Recommendations., , , и . Entropy, 25 (9): 1360 (сентября 2023)A Secure Matrix Inversion Protocol for IoT Applications in Smart Home Systems., , , и . ICCCNT, стр. 1-5. IEEE, (2021)Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three., , и . COCOON, том 9797 из Lecture Notes in Computer Science, стр. 55-66. Springer, (2016)