An inductive construction of minimally rigid body-hinge simple graphs

Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we propose an inductive construction of minimally rigid body-hinge simple graphs. Inductive construction is one of well-studied topics in Combinatorics and Combinatorial Optimization. We develop an inductive construction for minimally rigid body-hinge simple graphs in d-dimension with d ≥ 3 by which we can develop a polynomial-time algorithm for enumerating all minimally rigid body-hinge simple graphs.

Original languageEnglish
Title of host publicationCombinatorial Optimization and Applications - 7th International Conference, COCOA 2013, Proceedings
Pages165-177
Number of pages13
DOIs
Publication statusPublished - 2013
Event7th International Conference on Combinatorial Optimization and Applications, COCOA 2013 - Chengdu, China
Duration: Dec 12 2013Dec 14 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8287 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th International Conference on Combinatorial Optimization and Applications, COCOA 2013
Country/TerritoryChina
CityChengdu
Period12/12/1312/14/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'An inductive construction of minimally rigid body-hinge simple graphs'. Together they form a unique fingerprint.

Cite this