Titel: | Contact Graphs of Circular Arcs |
---|---|
AutorInnen: |
Md. Jawaherul Alam
David Eppstein Michael Kaufmann Stephen G. Kobourov Sergey Pupyrev André Schulz Torsten Ueckerdt |
Kategorie: | Konferenzbandbeiträge |
erschienen in: | Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, pp. 1-13 |
Abstract: | We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)-sparse if every s-vertex subgraph has at most |
Download: | Proceeding Website |
BibTeX-Eintrag: | @inproceedings{AEKKPSU15, author = {Md. Jawaherul Alam and David Eppstein and Michael Kaufmann and Stephen G. Kobourov and Sergey Pupyrev and Andr{\'{e}} Schulz and Torsten Ueckerdt}, editor = {Frank Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Ulrike Stege}, title = {Contact Graphs of Circular Arcs}, booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS} 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9214}, pages = {1--13}, publisher = {Springer}, year = {2015}, url = {http://dx.doi.org/10.1007/978-3-319-21840-3_1}, doi = {10.1007/978-3-319-21840-3_1} } |