Search Results for author:
Found 3 papers, 2 papers with code
Inferring community structure in attributed hypergraphs using stochastic block models
Hypergraphs are a representation of complex systems involving interactions among more than two entities and allow to investigation of higher-order structure and dynamics in real-world complex systems.
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
The complexity of UNO
This paper investigates the popular card game UNO from the viewpoint of algorithmic combinatorial game theory.
Discrete Mathematics Computational Complexity G.2; F.1
