Tractabilities and Intractabilities on Geometric Intersection Graphs†
AbstractA 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. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Uehara, R. Tractabilities and Intractabilities on Geometric Intersection Graphs. Algorithms 2013, 6, 60-83.
Uehara R. Tractabilities and Intractabilities on Geometric Intersection Graphs. Algorithms. 2013; 6(1):60-83.Chicago/Turabian Style
Uehara, Ryuhei. 2013. "Tractabilities and Intractabilities on Geometric Intersection Graphs." Algorithms 6, no. 1: 60-83.