no code implementations • 30 Oct 2021 • Govind Sharma, Aditya Challa, Paarth Gupta, M. Narasimha Murty
In this article, we investigate this problem in the presence of higher-order relations.
1 code implementation • 30 Oct 2021 • Govind Sharma, Swyam Prakash Singh, V. Susheela Devi, M. Narasimha Murty
Usual relations between entities could be captured using graphs; but those of a higher-order -- more so between two different types of entities (which we term "left" and "right") -- calls for a "bipartite hypergraph".
no code implementations • 3 Jun 2021 • Shyni Thomas, M. Narasimha Murty
Multi Agent Path Finding (MAPF) requires identification of conflict free paths for agents which could be point-sized or with dimensions.
no code implementations • 19 Jul 2020 • Sambaran Bandyopadhyay, Manasvi Aggarwal, M. Narasimha Murty
Towards this end, we propose a graph classification algorithm called SubGattPool which jointly learns the subgraph attention and employs two different types of hierarchical attention mechanisms to find the important nodes in a hierarchy and the importance of individual hierarchies in a graph.
no code implementations • 8 Jun 2020 • Sambaran Bandyopadhyay, Manasvi Aggarwal, M. Narasimha Murty
Invent of graph neural networks has improved the state-of-the-art for both node and the entire graph representation in a vector space.
no code implementations • 9 Feb 2020 • Sambaran Bandyopadhyay, Kishalay Das, M. Narasimha Murty
Then we propose to use graph convolution on the line graph of a hypergraph.
no code implementations • 27 Dec 2016 • Anubhav Gupta, M. Narasimha Murty
The KDD Cup $2016$ competition considers one such problem, which is to measure the impact of research institutions, i. e. to perform ranking of research institutions.
Social and Information Networks Information Retrieval