Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102419
Title: MapSets: Visualizing embedded and clustered graphs
Authors: Efrat, A.
Hu, Y.
Kobourov, S. G.
Pupyrev, S.
Issue Date: 2014
Publisher: Springer Verlag
Citation: MapSets: Visualizing embedded and clustered graphs / A. Efrat, Y. Hu, S. G. Kobourov, et al. — DOI 10.1007/978-3-662-45803-7_38 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2014. — Vol. 8871. — P. 452-463.
Abstract: We describe MapSets, a method for visualizing embedded and clustered graphs. The proposed method relies on a theoretically sound geometric algorithm, which guarantees the contiguity and disjointness of the regions representing the clusters, and also optimizes the convexity of the regions. A fully functional implementation is available online and is used in a comparison with related earlier methods. © Springer-Verlag Berlin Heidelberg 2014.
Keywords: COMPUTER SCIENCE
COMPUTERS
CLUSTERED GRAPH
DISJOINTNESS
GEOMETRIC ALGORITHM
ARTIFICIAL INTELLIGENCE
URI: http://hdl.handle.net/10995/102419
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 84915818682
PURE ID: 333047
69747674-fd1c-4bc6-b2fd-938885a2dcf5
ISSN: 3029743
DOI: 10.1007/978-3-662-45803-7_38
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84915818682.pdf889,16 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.