◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Heping Jiang

8 papers hereh-index 595 citations59 works total

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

author position
  • sole author8

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

fields
  • cs.DM8

identity via Semantic Scholar / OpenAlex

activity
20122021
most citedThe 1-1 algorithm for Travelling Salesman Problem

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

collaborators
Showing 2019Show all

2 papers · 1 filter

cs.DM2019

The induced subgraph K_2_,_3 in a non-Hamiltonian graphs

Heping Jiang

A graph G is a tuple (V,E), where V is the vertex set, E is the edge set. A reduced graph is a graph of deleting non-Hamiltoni…

cs.DM2019

Non-Hamilton cycle sets of having solutions and their properties

Heping Jiang

A graph \textit{G} is a tuple (\textit{V}, \textit{E}), where \textit{V} is the vertex set, \textit{E} is the edge set. A reduced graph is a graph of deleting non-Hamiltonian edges…

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