Attributes | Values |
---|
rdf:type
| |
Description
| - We study the Clique problem in classes of intersection graphs of convex sets in the plane. The problem is known to be NP-complete in convex-sets intersection graphs and straight-line-segments intersection graphs, but solvable in polynomial time in intersection graphs of homothetic triangles. We extend the latter result by showing that for every convex polygon P with k sides, every n-vertex graph which is an intersection graph of homothetic copies of P contains at most n 2k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, so called k DIR -CONV, which are intersection graphs of convex polygons whose all sides are parallel to at most k directions. We further provide lower bounds on the numbers of maximal cliques, discuss the complexity of recognizing these classes of graphs and present relationship with other classes of convex-sets intersection graphs.
- We study the Clique problem in classes of intersection graphs of convex sets in the plane. The problem is known to be NP-complete in convex-sets intersection graphs and straight-line-segments intersection graphs, but solvable in polynomial time in intersection graphs of homothetic triangles. We extend the latter result by showing that for every convex polygon P with k sides, every n-vertex graph which is an intersection graph of homothetic copies of P contains at most n 2k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, so called k DIR -CONV, which are intersection graphs of convex polygons whose all sides are parallel to at most k directions. We further provide lower bounds on the numbers of maximal cliques, discuss the complexity of recognizing these classes of graphs and present relationship with other classes of convex-sets intersection graphs. (en)
|
Title
| - Beyond homothetic polygons: recognition and maximum clique
- Beyond homothetic polygons: recognition and maximum clique (en)
|
skos:prefLabel
| - Beyond homothetic polygons: recognition and maximum clique
- Beyond homothetic polygons: recognition and maximum clique (en)
|
skos:notation
| - RIV/00216208:11320/12:10128144!RIV13-GA0-11320___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...iv/cisloPeriodika
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216208:11320/12:10128144
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - maximum clique; recognition problem; complexity; homothetic convex polygons (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...odStatuVydavatele
| - DE - Spolková republika Německo
|
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...i/riv/nazevZdroje
| - Lecture Notes in Computer Science
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...v/svazekPeriodika
| |
http://linked.open...iv/tvurceVysledku
| - Kratochvíl, Jan
- Junosza-Szaniawski, Konstanty
- Pergel, Martin
- Rzążewski, Paweł
|
issn
| |
number of pages
| |
http://bibframe.org/vocab/doi
| - 10.1007/978-3-642-35261-4_64
|
http://localhost/t...ganizacniJednotka
| |