Skip to content
Log in
Sponsored Design Multi-Agent AI Systems Using MCP and A2A: Engineer your own Pyt Design Multi-Agent AI Systems Using MCP and A2A: Engineer your own Pyt

Author

M. Enduri

View on Semantic Scholar

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Sep 2026

Maximal Cliques as a Normal Form in the Algebra of Graphs: Compression by Modular Decomposition and an Enumeration Algorithm

The finite simple graphs with vertices in a set S form an algebra G(S) under union and join, generated by the one-vertex graphs. We show that this algebra has a canonical normal form whose data are exactly the maximal cliques of the graph. Precisely, every g∈G(S) admits a unique maximal-clique decomposition μ(g), chara...

B. Sarma, Gete Umbrey, M. Enduri · 0 citations
Open access Oct 2026

Reducing Trace-Complexity Bias in Microservice Anomaly Scoring via Weighted Residual Service Trace Vectors

WR-STV is proposed, which applies clipped feature-wise standardized residuals and log-frequency reliability weighting to reduce structural score dependence in controlled STV-visible latency ranking; they do not establish performance for naturally occurring incidents or non-latency anomaly types.

Pavan Kumar Ramina, M. Enduri · 0 citations
Open access Sep 2026

Finding influential nodes via isolated local average shortest path with an extended neighborhood

Experimental findings show that LAISC surpasses traditional centrality measures in effectively spreading information across complex networks, and incorporates the extended neighborhood concept for finding the nearest neighbor nodes for all nodes in a graph.

ReddyPriya Madupuri, M. Enduri, Satish Anamalamudi et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.