About J-GLOBAL

日本語

Font size
  • A
  • A

Articleの詳細情報

ArticleJ-GLOBAL ID:200902015684031928整理番号:83A0166062

An approximation algorithm for the maximum independent set problem on planar graphs.

平面グラフの最大の独立な集合問題の近似アルゴリズム

著者:CHIBA N(Tohoku Univ.)、NISHIZEKI T(Tohoku Univ.)、SAITO N(Tohoku Univ.)
資料名:SIAM J Comput (Soc Ind Appl Math) 巻:11 号:4 ページ:663-675
発行年:1982年11月
  • J-GLOBAL home
  • Bookmark J-GLOBAL

J-GLOBAL: Linking, Expanding and Sparking

About J-GLOBAL

Linking

J-GLOBAL links information that represents the key to research and development. For example, linking articles and patents with people (authors and inventors) enables the extraction of a sequence of information.
It’s useful for making new discoveries and uncovering new information.

Expanding

The system enables searches of similar kinds of content through linkage with external sites.
It helps you to obtain knowledge from dissimilar fields and discover concepts that cross the boundaries of specialisms.

Sparking

Through repeated linkage and expansioniteration, J-GLOBAL provides unexpected hints for problem-solving and the illumination of new ideas.