Hardness Complexity of Optimal Substructure Problems on Power-Law Graphs

DOI10.1007/978-1-4614-0754-6_10zbMath1250.05102OpenAlexW48444036MaRDI QIDQ2913785

My T. Thai, Yilin Shen, Dung Tien Nguyen

Publication date: 27 September 2012

Published in: Handbook of Optimization in Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0754-6_10

zbMATH Keywords

maximum independent setmaximum cliqueminimum coloringminimum vertex coverminimum dominating set\(\rho \)-minimum dominating set

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

This page was built for publication: Hardness Complexity of Optimal Substructure Problems on Power-Law Graphs