Computational complexity of the negative decision number of graphs

zbMATH Open1256.05173MaRDI QIDQ2906856FDOQ2906856

Hongyu Liang

Publication date: 5 September 2012

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p191.pdf

zbMATH Keywords

bad functionnegative votes

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (1)

• Lower negative decision number in a graph

This page was built for publication: Computational complexity of the negative decision number of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906856)