point visibility
Recently Published Documents

TOTAL DOCUMENTS

25
(FIVE YEARS 2)

H-INDEX

7
(FIVE YEARS 0)
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

scholarly journals Generalized lattice-point visibility in ℕk

2021 ◽  
Vol 14 (1) ◽  
pp. 103-118
Author(s):  
Carolina Benedetti ◽  
Santiago Estupiñan ◽  
Pamela E. Harris
Keyword(s):  
Lattice Point ◽  
Point Visibility

scholarly journals On colouring point visibility graphs

2020 ◽  
Vol 286 ◽  
pp. 78-90
Author(s):  
Ajit Arvind Diwan ◽  
Bodhayan Roy
Keyword(s):  
Visibility Graphs ◽  
Point Visibility

Devising a lab-built point visibility meter

2019 ◽  
Author(s):  
Nathaniel A. Ferlic ◽  
Miranda van Iersel ◽  
Christopher C. Davis
Keyword(s):  
Point Visibility

scholarly journals Computational complexity aspects of point visibility graphs

2019 ◽  
Vol 254 ◽  
pp. 283-290 ◽  
Author(s):  
Anne-Sophie Himmel ◽  
Clemens Hoffmann ◽  
Pascal Kunz ◽  
Vincent Froese ◽  
Manuel Sorge
Keyword(s):  
Computational Complexity ◽  
Visibility Graphs ◽  
Point Visibility

scholarly journals Lattice Point Visibility on Generalized Lines of Sight

2018 ◽  
Vol 125 (7) ◽  
pp. 593-601 ◽  
Author(s):  
Edray H. Goins ◽  
Pamela E. Harris ◽  
Bethany Kubik ◽  
Aba Mbirika
Keyword(s):  
Lattice Point ◽  
Point Visibility

scholarly journals Recognition and Complexity of Point Visibility Graphs

2016 ◽  
Vol 57 (1) ◽  
pp. 164-178 ◽  
Author(s):  
Jean Cardinal ◽  
Udo Hoffmann
Keyword(s):  
Visibility Graphs ◽  
Point Visibility

scholarly journals On weak lattice point visibility

2016 ◽  
Vol 9 (3) ◽  
pp. 411-414 ◽  
Author(s):  
Neil R. Nicholson ◽  
Rebecca Rachan
Keyword(s):  
Lattice Point ◽  
Point Visibility

scholarly journals Point Visibility Graph Recognition is NP-Hard

2016 ◽  
Vol 26 (01) ◽  
pp. 1-32 ◽  
Author(s):  
Bodhayan Roy
Keyword(s):  
Polynomial Time ◽  
Visibility Graph ◽  
Np Hard ◽  
Graph Recognition ◽  
Visibility Graphs ◽  
Point Visibility

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.

Load More ...
Sign in / Sign up

Export Citation Format

Share Document