<--- Back to Details
First PageDocument Content
Graph drawing / Force-directed graph drawing / Graph theory / Planar graph / Graph / Algorithm / Shortest path problem / Meurs Challenger / Graph rewriting
Date: 2009-09-22 08:49:28
Graph drawing
Force-directed graph drawing
Graph theory
Planar graph
Graph
Algorithm
Shortest path problem
Meurs Challenger
Graph rewriting

Scheffler_Algorithmics_paper

Add to Reading List

Source URL: scheffler.fh-stralsund.de

Download Document from Source Website

File Size: 670,64 KB

Share Document on Facebook

Similar Documents

Graph drawing / Mathematics / Topological graph theory / Force-directed graph drawing / Circular layout / Graph / Connectivity / Tree / Computer graphics / Combinatorics / Discrete mathematics / Meurs Challenger

1802 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. 22,

DocID: 1r1c7 - View Document

Graph drawing software / Social networks / Graph drawing / Connectivity / Social network analysis / Graph / Flow network / Meurs Challenger / Force-directed graph drawing

E:nections(1)ckhardt#####krackhardtgif.wpd

DocID: 1pl1b - View Document

Graph drawing / Force-directed graph drawing / Graph theory / Planar graph / Graph / Algorithm / Shortest path problem / Meurs Challenger / Graph rewriting

Scheffler_Algorithmics_paper

DocID: 1p2Y8 - View Document