Hardness Complexity of Optimal Substructure Problems on Power-Law Graphs

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

Yilin Shen, My T. Thai, 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 set; maximum clique; minimum coloring; minimum vertex cover; minimum dominating set; \(\rho \)-minimum dominating set

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C20: Directed graphs (digraphs), tournaments