Encyclopedia of Social Network Analysis and Mining 2017
DOI: 10.1007/978-1-4614-7163-9_315-1
|View full text |Cite
|
Sign up to set email alerts
|

Tulip 5

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
23
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
2
1
1

Relationship

3
5

Authors

Journals

citations
Cited by 37 publications
(23 citation statements)
references
References 43 publications
0
23
0
Order By: Relevance
“…The NetworkX library (Hagberg et al 2008) is prevalent for the Python environment, while the igraph library (Nepusz and Csárdi 2006) is commonly used among the R users. C, and C++ alternatives include SNAP (Leskovec and Sosič 2016), Boost Graph Library (BGL) (The Boost Graph Library 2002), and Tulip (Auber 2004;Auber et al 2017). Compared to GUI-based analysis, APIbased approaches result in a series of high-level function calls, which generate the desired output.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The NetworkX library (Hagberg et al 2008) is prevalent for the Python environment, while the igraph library (Nepusz and Csárdi 2006) is commonly used among the R users. C, and C++ alternatives include SNAP (Leskovec and Sosič 2016), Boost Graph Library (BGL) (The Boost Graph Library 2002), and Tulip (Auber 2004;Auber et al 2017). Compared to GUI-based analysis, APIbased approaches result in a series of high-level function calls, which generate the desired output.…”
Section: Related Workmentioning
confidence: 99%
“…This paper significantly extends the work on multilayer network visualization and analysis presented in our previous conference publication (Škrlj et al 2019). First, the related work section ("Related work" section) has been extended by including tools Pajek (Batagelj and Mrvar 2001) and Tulip (Auber 2004;Auber et al 2017) that inspired the creation of Py3plex. Next, we extended the description of the library's features ("Key features" section).…”
Section: Introductionmentioning
confidence: 99%
“…MDS-like approaches to drawing graphs are exemplified in algorithms such as that of Kamada-Kawai [19], Koren and Carmel [25]. Most commonly used graph drawing systems, such as Graphviz [13], Pajek [5], Tulip [2] and Gephi [4], provide options to visualize graphs in 3D based on MDS-like optimization. Variants of MDS are used in many graph layout systems, including [10,15,30,37].…”
Section: Previous Workmentioning
confidence: 99%
“…force-directed, hierarchical, orthogonal and spectral) to generate informative and appealing 2D/3D views thus minimizing any possible node overlaps and connection crossovers (3). Among a decent variety of applications today (4, 5), widely-used interactive 2D visualizers include the Cytoscape (6), Cytoscape.js (7), String (8), NORMA (9), Gephi (10), Pajek (11) and Tulip (12) whereas successful 3D visualizers include the Graphia (Kajeka) and BioLayout Express (13).…”
Section: Introductionmentioning
confidence: 99%