The P versus NP–complete dichotomy of some challenging problems in graph theory

The Clay Mathematics Institute has selected seven Millennium Problems to motivate research on important classic questions that have resisted solution over the years. Among them is the central problem in theoretical computer science: the P versus NP problem, which aims to classify the possible existe...

Celý popis

Podrobná bibliografie

Vydáno v:	Discrete Applied Mathematics Ročník 160; číslo 18; s. 2681 - 2693
Hlavní autor:	de Figueiredo, Celina M.H.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.12.2012
Témata:	Analysis of algorithms and problem complexity Classification Combinatorial analysis Dichotomies Graph algorithms Graph theory Graphs Mathematical models Optimization Partitions Structural characterization of types of graphs Analysis of algorithms and problem complexity Graph algorithms Structural characterization of types of graphs
ISSN:	0166-218X, 1872-6771
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!