Search Results for author:
Found 2 papers, 1 papers with code
K-plex Cover Pooling for Graph Neural Networks
We introduce a novel pooling technique which borrows from classical results in graph theory that is non-parametric and generalizes well to graphs of different nature and connectivity pattern.
Proximity Search For Maximal Subgraph Enumeration
Using known techniques, such as reverse search, the space of all maximal solutions induces an implicit directed graph called "solution graph" or "supergraph", and solutions are enumerated by traversing it; however, nodes in this graph can have exponential out-degree, thus requiring exponential time to be spent on each solution.
Data Structures and Algorithms 05C30, 05C85 F.2.2
