Back to Search
Start Over
Tractabilities and Intractabilities on Geometric Intersection Graphs.
- Source :
-
Algorithms . Mar2013, Vol. 6 Issue 1, p60-83. 24p. 6 Diagrams, 4 Charts, 3 Graphs. - Publication Year :
- 2013
-
Abstract
- A graph is said to be an intersection graph if there is a set of objects such that each vertex corresponds to an object and two vertices are adjacent if and only if the corresponding objects have a nonempty intersection. There are several natural graph classes that have geometric intersection representations. The geometric representations sometimes help to prove tractability/intractability of problems on graph classes. In this paper, we show some results proved by using geometric representations. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 19994893
- Volume :
- 6
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Algorithms
- Publication Type :
- Academic Journal
- Accession number :
- 86660882
- Full Text :
- https://doi.org/10.3390/a6010060