Clique Graph Recognition Is NP-Complete

A complete set of a graph G is a subset of V inducing a complete subgraph. A clique is a maximal complete set. Denote by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Alcón, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Complete Graph Computer science control theory systems Exact sciences and technology Information retrieval. Graph Intersection Graph Nonempty Intersection Planar Graph Theoretical computing Truth Assignment
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!