全部 |
  • 全部
  • 题名
  • 作者
  • 机构
  • 关键词
  • NSTL主题词
  • 摘要
检索 二次检索 AI检索
外文文献 中文文献
筛选条件:

1. Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms NSTL国家科技图书文献中心

Takumi Shiota |  Toshiki Saitoh -  《WALCOM: Algorithms and Computation: 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), March 22-24, 2023, Hsinchu, Taiwan》 -  International Conference and Workshops on Algorithms and Computation - 2023, - 36~48 - 共13页

摘要:Herein, we discuss the existence of overlapping edge unfoldings for Archimedean solids and (anti)prisms. Horiyama and Shoji showed that there are no overlapping edge unfoldings for all platonic solids...
关键词: Polyhedron |  Overlapping edge unfolding |  Archimedean solids |  Archimedean (anti)prisms |  Enumeration algorithm

2. Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs NSTL国家科技图书文献中心

Jun Kawahara |  Toshiki Saitoh... -  《WALCOM: Algorithms and Computation: 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), March 22-24, 2023, Hsinchu, Taiwan》 -  International Conference and Workshops on Algorithms and Computation - 2023, - 151~163 - 共13页

摘要:Intersection graphs are well-studied in the area of graph algorithms. Some intersection graph classes are known to have algorithms enumerating all unlabeled graphs by reverse search. Since these algor...
关键词: Enumeration |  Binary decision diagrams |  Graph isomorphism |  Graph classes |  String representation

3. Path Cover Problems with Length Cost NSTL国家科技图书文献中心

Kenya Kobayashi |  Guohui Lin... -  《Algorithmica》 - 2023,85(11) - 3348~3375 - 共28页 - 被引量:3

摘要:For a graph G = (V, E), a collection P of vertex-disjoint (simple) paths is called a path cover of G if every vertex v∈ V is contained in exactly one path of P.The PATH COVER problem (PC for short) is...
关键词: Path cover problem |  NP-hardness |  Treewidth |  Approximation algorithm |  Planar bipartite graph |  Subcubic graph

4. Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes NSTL国家科技图书文献中心

Toshiki Saitoh |  Ryo Yoshinaka... -  《WALCOM: Algorithms and Computation: 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), February 28 – March 2, 2021, Yangon, Myanmar》 -  International Conference and Workshops on Algorithms and Computation - 2021, - 142~153 - 共12页

摘要:For a graph class C, the C-EDGE-DELETION problem asks for a given graph G to delete the minimum number of edges from G in order to obtain a graph in C. We study the C-EDGE-DELETION problem for C the c...
关键词: Parameterized algorithms |  Treewidth |  Edge-Deletion |  Interval graphs
NSTL主题词: efficient algorithm |  algorithms |  Classes

5. Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs NSTL国家科技图书文献中心

Jun Kawahara |  Toshiki Saitoh... -  《Analysis of Experimental Algorithms: Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers》 -  Special Event on Analysis of Experimental Algorithms - 2019, - 125~141 - 共17页

摘要:This paper considers enumeration of specific subgraphs of a given graph by using a data structure called a zero-suppressed binary decision diagram (ZDD). A ZDD can represent the set of solutions quite...
关键词: Graph algorithm |  Graph enumeration |  Decision diagram |  Frontier-based search |  Interval graph |  Chordal graph
NSTL主题词: Chord |  Implicit

6. Max-Min 3-Dispersion Problems NSTL国家科技图书文献中心

Takashi Horiyama |  Shin-ichi Nakano... -  《Computing and Combinatorics: 25th International Computing and Combinatorics Conference (COCOON 2019), 29–31 July 2019, Xi an, China》 -  International Computing and Combinatorics Conference - 2019, - 291~300 - 共10页

摘要:Given a set P of n points on which facilities can be placed and an integer k, we want to place k facilities on some points so that the minimum distance between facilities is maximized. The problem is ...
关键词: Dispersion problem |  Facility location

7. Shortest Universal Sequences of Adjacent Transpositions NSTL国家科技图书文献中心

Takehiro ITO |  Jun KAWAHARA... -  《電子情報通信学会技術研究報告. 情報システムソサイエティ各誌》 - 2019,119(191) - 1~5 - 共5页

摘要:Let S = 〈s_1,s_2,...,s_m〉 be a sequence of adjacent transpositions of [n] = {1,2,...,n}. We denote by Comp(S) = s_m · s_(m-1) · ··· · s_1 the composition of transpositions in S from s_1 to s_m. Let us...
关键词: Permutation |  Adjacent transposition |  Universal sequence

8. Computational Complexity of Robot Arm Simulation Problems NSTL国家科技图书文献中心

Tianfeng Feng |  Takashi Horiyama... -  《Combinatorial Algorithms: 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings》 -  International Workshop on Combinatorial Algorithms - 2018, - 177~188 - 共12页

摘要:We consider a simulation problem of a general mechanism by a robot arm. A robot arm can be modeled by a path P, and the target is modeled by a general graph G. Then the problem asks if there is an edg...
关键词: Edge-weighted Eulerian path problem Graph spanning problem |  Linkage |  Robot arm

9. Computational Complexity of Robot Arm Simulation Problems NSTL国家科技图书文献中心

Tianfeng Feng |  Takashi Horiyama... -  《Combinatorial algorithms: 28th international workshop on combinatorial algorithms (IWOCA 2018), July 17-21 2017, Newcastle, NSW, Australia》 -  International workshop on combinatorial algorithms - 2018, - 177~188 - 共12页

摘要:We consider a simulation problem of a general mechanism by a robot arm. A robot arm can be modeled by a path P, and the target is modeled by a general graph G. Then the problem asks if there is an edg...
关键词: Edge-weighted Eulerian path problem Graph spanning problem |  Linkage |  Robot arm

10. Exact Algorithms for the Max-Min Dispersion Problem NSTL国家科技图书文献中心

Toshihiro Akagi |  Tetsuya Araki... -  《Frontiers in Algorithmics: 12th International Workshop, FAW 2018, Guangzhou, China, May 8-10, 2018, Proceedings》 -  International Frontiers of Algorithmics Workshop - 2018, - 263~272 - 共10页

摘要:Given a set P of n elements, and a function d that assigns a non-negative real number d(p,q) for each pair of elements p,q ∈ P, we want to find a subset S {is contained in} P with |S| = k such that co...
关键词: Dispersion problem |  Algorithm
NSTL主题词: Exact |  algorithms |  Dispersion |  dispersion
检索条件作者:Toshiki Saitoh

NSTL主题词

  • NSTL学科导航