Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Circle packing theoremGeometric separatorGraph (discrete mathematics)Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Social and location based routing in delay tolerant networks
Delay tolerant networks (DTNs) are a special type of wireless mobile networks, which may lack continuous network connectivity… 
2013
2013
Traffic Control for Network Protection Against Spreading Processes
Epidemic outbreaks in human populations are facilitated by the underlying transportation network. We consider strategies for… 
2013
2013
Distinguishing Infections on Different Graph Topologies
The history of infections and epidemics holds famous examples where understanding, containing, and ultimately treating an… 
2012
2012
On identifying the causative network of an epidemic
The history of infections and epidemics holds famous examples where understanding, containing and ultimately treating an outbreak… 
2012
2012
3G-assisted routing in vehicular networks
Efficient data delivery in vehicular ad hoc networks (VANETs) is particularly challenging due to the unique characteristics of… 
2011
2011
Linear-Time Algorithms for Proportional Contact Graph Representations ?
In a proportional contact representation of a planar graph, each vertex is represented by a simple polygon with area proportional… 
2010
2010
Applications of Three Dimensional Extremal Length, I: Tiling of a Topological Cube
Given a triangulation of a closed topological cube, we show that (under some technical condition) there is an essentially unique… 
2010
2010
Technologies to generate contact graphs for personal social networks
This paper presents three novel means of collecting and analyzing data to generate contact graphs of personal social networks… 
2000
2000
Generating polyhedral convex cones from contact graphs for the identification of assembly process states
A new approach to automatically generate polyhedral convex cones from contact graphs for identification of assembly process… 
1995
1995
Recurrent random walks, Liouville's theorem and circle packings
  • T. Dubejko
  • Mathematical Proceedings of the Cambridge…
  • 1995
  • Corpus ID: 5631354
It has been shown that univalent circle packings filling the complex plane C are unique up to similarities of C. Here we prove… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)