◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Yang-Yu Liu

23 papers hereh-index 236.8k citations57 works total

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

author position
  • first author3
  • middle author9
  • last author10

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

fields
  • physics.soc-ph9
  • cond-mat.dis-nn3
  • eess.SY3
  • cond-mat.stat-mech2
  • math.OC2
  • cs.LG1
same name
  • Yang-Yu Liu — 5 papers, h 4
  • Yang-Yu Liu — 5 papers, h 28
  • Yang-Yu Liu — 3 papers, h 4
  • Yang-Yu Liu — 3 papers, h 15
  • Yang-Yu Liu — 2 papers, h 6
  • Yang-Yu Liu — 2 papers, h 1

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

activity
20122026
most citedControl Principles of Complex Networks

680 citations · 2.2k across the 23 of their papers we have counts for

collaborators
Showing 2016Show all

4 papers · 1 filter

physics.soc-ph2016★ 33 cited

Bridges in Complex Networks

Ang-Kun Wu, Liang Tian, Yang-Yu Liu

A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-wo…

eess.SY2016★ 1 cited

Sensitivity of Complex Networks

Marco Tulio Angulo, Gabor Lippner, Yang-Yu Liu +1

The sensitivity (i.e. dynamic response) of complex networked systems has not been well understood, making difficult to predict whether new macroscopic dynamic behavior will emerge…

physics.soc-ph2016★ 117 cited

Articulation Points in Complex Networks

Liang Tian, Amir Bashan, Da-Ning Shi +1

An articulation point in a network is a node whose removal disconnects the network. Those nodes play key roles in ensuring connectivity of many real-world networks, from infrastruc…

cond-mat.dis-nn2016★ 63 cited

Covering Problems and Core Percolations on Hypergraphs

Bruno Coelho Coutinho, Hai-Jun Zhou, Yang-Yu Liu

Covering problems are classical computational problems concerning whether a certain combinatorial structure 'covers' another. For example, the minimum vertex covering problem aims…

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