On the Hardness of Optimization in Power Law Graphs

DOI10.1007/978-3-540-73545-8_41zbMath1206.05096OpenAlexW1710013235MaRDI QIDQ3608866

Kihong Park, Alessandro Ferrante, Gopal Pandurangan

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_41

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (4)

Finding Cliques in Social Networks: A New Distribution-Free Model ⋮ Unnamed Item ⋮ On positive-influence target-domination ⋮ Decompositions of Triangle-Dense Graphs

This page was built for publication: On the Hardness of Optimization in Power Law Graphs