scholarly journals LGBTQI Parented Families and Schools: Visibility, Representation, and Pride

2019 ◽  
Vol 8 (2) ◽  
Author(s):  
Kris Clarke
Keyword(s):  
Visibility Representation

A Visibility Representation for Graphs in Three Dimensions

2002 ◽  
pp. 103-118
Author(s):  
Prosenjit Bose ◽  
Hazel Everett ◽  
Sándor P. Fekete ◽  
Michael E. Houle ◽  
Anna Lubiw ◽  
...  
Keyword(s):  
Three Dimensions ◽  
Visibility Representation

scholarly journals The Partial Visibility Representation Extension Problem

2016 ◽  
pp. 266-279 ◽  
Author(s):  
Steven Chaplick ◽  
Grzegorz Guśpiel ◽  
Grzegorz Gutowski ◽  
Tomasz Krawczyk ◽  
Giuseppe Liotta
Keyword(s):  
Extension Problem ◽  
Visibility Representation

AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING

2006 ◽  
Vol 17 (05) ◽  
pp. 1129-1141 ◽  
Author(s):  
HUAMING ZHANG ◽  
XIN HE
Keyword(s):  
Graph Drawing ◽  
Linear Time ◽  
Plane Graph ◽  
Visibility Representation ◽  
Powerful Technique ◽  
Graph Generation

Well-orderly tree is a powerful technique capable of deriving new results in graph encoding, graph enumeration and graph generation [3, 5]. In this paper, by using well-orderly trees, we prove that any plane graph G with n vertices has a visibility representation with height [Formula: see text], which can be constructed in linear time. This improves the best previous bound of [Formula: see text].

scholarly journals Characterization of $[1,k]$-Bar Visibility Trees

10.37236/1116 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Guantao Chen ◽  
Joan P. Hutchinson ◽  
Ken Keating ◽  
Jian Shen
Keyword(s):  
Knapsack Problem ◽  
Unit Length ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Visibility Representation ◽  
Visibility Graphs ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Special Case

A unit bar-visibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unit-length bars such that two vertices are adjacent if and only if there is a unobstructed, non-degenerate, vertical band of visibility between the corresponding bars. We generalize unit bar-visibility graphs to $[1,k]$-bar-visibility graphs by allowing the lengths of the bars to be between $1/k$ and $1$. We completely characterize these graphs for trees. We establish an algorithm with complexity $O(kn)$ to determine whether a tree with $n$ vertices has a $[1,k]$-bar-visibility representation. In the course of developing the algorithm, we study a special case of the knapsack problem: Partitioning a set of positive integers into two sets with sums as equal as possible. We give a necessary and sufficient condition for the existence of such a partition.

Sign in / Sign up

Export Citation Format

Share Document