Contact graph

Known as: Tangency graph 
In the mathematical area of graph theory, a contact graph or tangency graph is a graph whose vertices are represented by geometric objects (e.g… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Opportunistic networks are formed by people carrying mobile devices with wireless capabilities. When in mutual transmission range… (More)
  • figure 1
  • figure 2
Is this relevant?
2013
2013
Opportunistic networking targets networks where end-to-end communication paths between nodes may not exist and it becomes… (More)
  • table I
  • figure 2
  • figure 3
  • table II
  • table III
Is this relevant?
2013
2013
The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) graph whose vertices… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
In a proportional contact representation of a planar graph, each vertex is represented by a simple polygon with area proportional… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Predicting human mobility is considered as a challenging problem. In this paper, we formulate the problem of human contact… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Contact graphs of isothetic rectangles unify many concepts from applications including VLSI and architectural design… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
MOTIVATION Complementing its traditional role in structural studies of proteins, nuclear magnetic resonance (NMR) spectroscopy is… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2006
2006
A necessary and sufficient condition is given for a connected bipartite graph to be the incidence graph of a contact family of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1998
1998
Let S be a collection of closed, orthogonal (i.e., vertical and horizontal) straight line segments. The contact graph of a… (More)
  • figure 1
Is this relevant?
1995
1995
A notion of random walks for circle packings is introduced. The geometry behind this notion is discussed, together with some… (More)
Is this relevant?