3 citations · 10 across the 10 of their papers we have counts for
5 papers · 1 filter
Computational Complexity of Swish
Takashi Horiyama, Takehiro Ito, Jun Kawahara +4
Swish is a card game in which players are given cards having symbols (hoops and balls), and find a valid superposition of cards, called a "swish." Dailly, Lafourcade, and Marcadet…
International Competition on Graph Counting Algorithms 2023
Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima +3
This paper reports on the details of the International Competition on Graph Counting Algorithms (ICGCA) held in 2023. The graph counting problem is to count the subgraphs satisfyin…
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration
Yu Nakahata, Jun Kawahara, Takashi Horiyama +1
Given graphs and , we propose a method to implicitly enumerate topological-minor-embeddings of in using decision diagrams. We show a useful application of our method…
Decomposing a Graph into Unigraphs
Takashi Horiyama, Jun Kawahara, Shin-ichi Minato +1
Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, m…
Practical Adversarial Combinatorial Bandit Algorithm via Compression of Decision Sets
Shinsaku Sakaue, Masakazu Ishihata, Shin-ichi Minato
We consider the adversarial combinatorial multi-armed bandit (CMAB) problem, whose decision set can be exponentially large with respect to the number of given arms. To avoid dealin…