Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs

IF 0.7 4区计算机科学

IEICE Transactions on Information and Systems Pub Date : 2024-06-01 DOI:10.1587/transinf.2023edp7214

Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh

引用次数: 0

查看原文本刊更多论文

欧氏最小权重拉曼图和（2,2）-紧密图的厚度和边缘交叉总数的下限

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEICE Transactions on Information and Systems COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING

自引率

0.00%

发文量

238

审稿时长

4.8 months

期刊介绍： Published by The Institute of Electronics, Information and Communication Engineers Subject Area: Mathematics Physics Biology, Life Sciences and Basic Medicine General Medicine, Social Medicine, and Nursing Sciences Clinical Medicine Engineering in General Nanosciences and Materials Sciences Mechanical Engineering Electrical and Electronic Engineering Information Sciences Economics, Business & Management Psychology, Education.