Searching for "An Algorithm for Drawing General Undirected Graphs." – sorted by Relevance.
-
A Practical Approach to Drawing Undirected Graphs
- -level reference for the layering method is [EX89]. Most algorithms for general undirected graphs view drawings
- Cited by 16 (1 self) – Add To MetaCart
-
SWAN: A Data Structure Visualization System 1
- algorithms to draw general undirected graphs. The first distributes nodes along the circumference of a circle
- Add To MetaCart
-
Aesthetics-based Graph Layout for Human Consumption
- for drawing general undirected graphs. Information Processing Letters, 31:7--15, April 1989. [Lam88] J. Lam
- Cited by 16 (0 self) – Add To MetaCart
-
Document Explorer Visualizations of WWW Document and Term Spaces
- developed [28, 29, 30]. Some of the aesthetics for drawings of general undirected graphs are symmetry
- Cited by 1 (1 self) – Add To MetaCart
-
Data Visualization, Indexing and Mining Engine - A Parallel Computing Architecture for Information Processing Over the Internet
- , there are relatively few algorithms for drawing general undirected graphs[66]. This is due in part to the inability
- Add To MetaCart
-
A Tool for Drawing Undirected Graphs
- of the problem of drawing a graph. This paper discusses an algorithm for drawing general undirected graphs
- Add To MetaCart
-
*udkdpruprgh .lqjv
- and S Kawai, An algorithm for drawing general undirected graphs, 1989 [KK89] This paper again considers
- Add To MetaCart

