|
Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks
|
|
Tatsuya INOHA, Kunihiko SADAKANE, Yushi UNO, Yuma YONEBAYASHI
|
105 |
3 |
451–458 |
2022 |
12.33 |
|
Average Rating: 0.0 / 5
(0 Reviews)
|
|
Research on Dissections of a Net of a Cube into Nets of Cubes
|
|
Tamami OKADA, Ryuhei UEHARA
|
105 |
3 |
459–465 |
2022 |
9.46 |
|
Average Rating: 0.0 / 5
(0 Reviews)
|
|
A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs
|
|
Taishu ITO, Yusuke SANO, Katsuhisa YAMANAKA, Takashi HIRAYAMA
|
105 |
3 |
466–473 |
2022 |
10.63 |
|
Average Rating: 0.0 / 5
(0 Reviews)
|
|
The Huffman Tree Problem with Upper-Bounded Linear Functions
|
|
Hiroshi FUJIWARA, Yuichi SHIRAI, Hiroaki YAMAMOTO
|
105 |
3 |
474–480 |
2022 |
7.58 |
|
Average Rating: 0.0 / 5
(0 Reviews)
|
|
An Improvement of the Biased-PPSZ Algorithm for the 3SAT Problem
|
|
Tong QIN, Osamu WATANABE
|
105 |
3 |
481–490 |
2022 |
10.43 |
|
Average Rating: 0.0 / 5
(0 Reviews)
|
|
Finite Automata with Colored Accepting States and Their Unmixedness Problems
|
|
Yoshiaki TAKAHASHI, Akira ITO
|
105 |
3 |
491–502 |
2022 |
9.45 |
|
Average Rating: 0.0 / 5
(0 Reviews)
|
|
An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position
|
|
Yasuaki KOBAYASHI, Shin-ichi NAKANO, Kei UCHIZAWA, Takeaki UNO, Yutaro ...
|
105 |
3 |
503–507 |
2022 |
13.2 |
|
Average Rating: 0.0 / 5
(0 Reviews)
|
|
Five Cells and Tilepaint are NP-Complete
|
|
Chuzo IWAMOTO, Tatsuya IDE
|
105 |
3 |
508–516 |
2022 |
12.16 |
|
Average Rating: 0.0 / 5
(0 Reviews)
|
|
Complexity of Critter Crunch
|
|
Tianfeng FENG, Leonie RYVKIN, Jérôme URHAUSEN, Giovanni VIGLIETTA
|
105 |
3 |
517–531 |
2022 |
8.52 |
|
Average Rating: 0.0 / 5
(0 Reviews)
|
|
Cyclic Shift Problems on Graphs
|
|
Kwon Kham SAI, Giovanni VIGLIETTA, Ryuhei UEHARA
|
105 |
3 |
532–540 |
2022 |
11.35 |
|
Average Rating: 0.0 / 5
(0 Reviews)
|