The following pages link to GVF (Q19493):
Displayed 20 items.
- Hearing the clusters of a graph: A distributed algorithm (Q445023) (← links)
- On crossing numbers of geometric proximity graphs (Q632725) (← links)
- Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach (Q1652097) (← links)
- On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps (Q1681355) (← links)
- Morphing Schnyder drawings of planar triangulations (Q1739203) (← links)
- Taming the knight's tour: minimizing turns and crossings (Q2067620) (← links)
- Spectral complexity of directed graphs and application to structural decomposition (Q2424711) (← links)
- Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm (Q2491331) (← links)
- Asymptotics of Visibility in the Hyperbolic Plane (Q2837750) (← links)
- Evaluation of Two Interaction Techniques for Visualization of Dynamic Graphs (Q2961548) (← links)
- Motif-based embedding for graph clustering (Q3302499) (← links)
- IT Incident Management as a Collaborative Process: A Visualization Tool Inspired to Social Networks (Q3407382) (← links)
- Drawing Huge Graphs by Algebraic Multigrid Optimization (Q4458275) (← links)
- (Q4674794) (← links)
- Review of statistical network analysis: models, algorithms, and software (Q4969842) (← links)
- Scalable Visual Analytics in FCA (Q5054985) (← links)
- Graph Drawing (Q5193173) (← links)
- (Q5456890) (← links)
- Journal on Data Semantics V (Q5898507) (← links)
- Approaches to visualization in bioinformatics: From dendrograms to space explorer (Q5956863) (← links)