Almost all string graphs are intersection graphs of plane convex sets
  • Metadata
Content: http://real.mtak.hu/82754/
Archive: REAL
Set: Status = Published
Type = Book Section
Subject = Q Science / természettudomány: QA Mathematics / matematika: QA166-QA166.245 Graphs theory / gráfelmélet
Title:
Almost all string graphs are intersection graphs of plane convex sets
Creator:
Pach, János
Reed, B.
Yuditsky, Y.
Contributor:
Toth, C. D.
Speckmann, B.
Publisher:
Schloss Dagstuhl Leibniz-Zentrum für Informatik
Date:
2018
Subject:
QA166-QA166.245 Graphs theory / gráfelmélet
Description:
Language:
English
Type:
Book Section
PeerReviewed
info:eu-repo/semantics/bookPart
Format:
text
Identifier:
Pach, János and Reed, B. and Yuditsky, Y. (2018) Almost all string graphs are intersection graphs of plane convex sets. In: 34th International Symposium on Computational Geometry, SoCG 2018. Leibniz International Proceedings in Informatics, LIPIcs (99). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 681-6814. ISBN 9783959770668
Relation:
https://doi.org/10.4230/LIPIcs.SoCG.2018.68
MTMT:3403155; doi:10.4230/LIPIcs.SoCG.2018.68