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...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 160; no. 18; pp. 2681 - 2693
Main Author:	de Figueiredo, Celina M.H.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.12.2012
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!