arXiv Open Access 2014

Point visibility graph recognition is NP-hard

Bodhayan Roy

Lihat Sumber

Abstrak

Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point visibility graphs is NP-hard.

Topik & Kata Kunci

cs.CG cs.CC cs.DM

Penulis (1)

Bodhayan Roy

Format Sitasi

APA MLA BibTeX

Roy, B. (2014). Point visibility graph recognition is NP-hard. https://arxiv.org/abs/1406.2428

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2014
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓