◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Hirokazu Takeda

1 paper hereh-index 11 citations2 works total

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

author position
  • middle author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.DS1

identity via Semantic Scholar / OpenAlex

collaborators

1 paper

cs.DS2022

Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs

Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda +2

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 searc…

◍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.