◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Iida

2 papers hereh-index 11476 citations151 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author2

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.DS1
  • cs.LG1
same name
  • M. Iida — 4 papers, h 17
  • M. Iida — 2 papers
  • M. Iida — 2 papers, h 11
  • M. Iida — 1 paper, h 2
  • M. Iida — 1 paper, h 10

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedA Heuristic Method of Generating Diameter 3 Graphs for Order/Degree Problem

8 citations · 8 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2016★ 8 cited

A Heuristic Method of Generating Diameter 3 Graphs for Order/Degree Problem

Teruaki Kitasuka, Masahiro Iida

We propose a heuristic method that generates a graph for order/degree problem. Target graphs of our heuristics have large order (> 4000) and diameter 3. We describe the ob- servati…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.