Skip to search formSkip to main contentSkip to account menu

Theta graph

In computational geometry, the Theta graph, or -graph, is a type of geometric spanner similar to a Yao graph. The basic method of construction… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
With respect to specific cycle-related problems, edge-colored graphs can be considered as a generalization of directed graphs. We… 
2019
2019
For G=GSp_4 we construct an automorphic sheaf correspinding to a G^L-local system on a curve X such that its standard… 
2019
2019
Abstract The Kinoshita graph is a particular embedding in the 3-sphere of a graph with three edges, two vertices, and no loops… 
2018
2018
The theta graph $\Theta_{\ell,t}$ consists of two vertices joined by $t$ vertex-disjoint paths of length $\ell$ each. For fixed… 
2015
2015
In online list coloring [introduced by Zhu (Electron J Comb 16(1):#R127, 2009) and Schauz (Electron J Comb 16:#R77, 2009)], on… 
2015
2015
The Kinoshita graph is the most famous example of a Brunnian theta graph, a nontrivial spatial theta graph with the property that… 
2012
2012
A generalized-theta-graph is a graph consisting of a pair of end vertices joined by k (k ≥ 3) internally disjoint paths. We… 
Review
2011
Review
2011
We present initial results from time-series imaging at infrared wavelengths of 0.9 deg2 in the Orion Nebula Cluster (ONC). During… 
2010
2010
The Yao and Theta graphs are defined for a given point set and a fixed integer k > 0. The space around each point is divided into… 
2000
2000
An edge-labeling f of a graph G is an injection from E(G) to the set of integers. The edge-bandwidth of G is B′(G) = minf {B′(f…