( en | de | ru )

 

Disambiguation of "Enduri, Murali Krishna"

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three.

, , and . COCOON, volume 9797 of Lecture Notes in Computer Science, page 55-66. Springer, (2016)

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. You can also use the button next to the name to display some publications already assigned to the person.

Murali Krishna Bollepalli

Aarthi Murali

Murali Sukumaran

Kota Murali

NULL Murali Dama

 

Other publications of authors with the same name

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