Journal of Graph Algorithms and Applications Using a Significant Spanning Tree to Draw a Directed Graph

No abstract is available for this paper.

• Publication year

  year unknown

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Practical Level Planarity Testing and Layout with Embedding Constraints

  2007cited by this paper
• Minimum Level Nonplanar Patterns for Trees

  2007cited by this paper
• Drawing rooted trees in linear time

  2006cited by this paper
• Visualizing Large and Clustered Networks

  2006cited by this paper
• On Layering Directed Acyclic Graphs

  2005cited by this paper
• Combining hierarchy and energy for drawing directed graphs

  2004cited by this paper
• Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

  2004cited by this paper
• Centrality Indices

  2004cited by this paper
• A characterization of level planar graphs

  2004cited by this paper
• Algorithms for multi-level graph planarity testing and layout

  2004cited by this paper
• Two New Heuristics for Two-Sided Bipartite Graph Drawing

  2002cited by this paper
• Fast and Simple Horizontal Coordinate Assignment

  2001cited by this paper
• On Bipartite Drawings and the Linear Arrangement Problem

  2001cited by this paper
• Graph Visualization and Navigation in Information Visualization: A Survey

  2000cited by this paper
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II

  1999cited by this paper
• Scheduling with time dependent processing times: Review and extensions

  1999cited by this paper
• Drawing Large Graphs with H3Viewer and Site Manager

  1998cited by this paper
• The Complexity of Scheduling Starting Time Dependent Tasks with Release Times

  1998cited by this paper
• Level Planarity Testing in Linear Time

  1998cited by this paper
• H3: laying out large directed graphs in 3D hyperbolic space

  1997cited by this paper
• NicheWorks - Interactive Visualization of Very Large Graphs

  1997cited by this paper
• On-line maintenance of triconnected components with SPQR-trees

  1996cited by this paper
• Edge crossings in drawings of bipartite graphs

  1994influential reference
• Drawing Graphs in Two Layers

  1994cited by this paper
• Structural analysis of hypertexts

  1992cited by this paper
• Optimal linear labelings and eigenvalues of graphs

  1992cited by this paper
• A node‐positioning algorithm for general trees

  1990cited by this paper
• Hierarchies and planarity theory

  1988cited by this paper
• Tidier Drawings of Trees

  1981cited by this paper
• Factoring and weighting approaches to status scores and clique identification

  1972cited by this paper
• Analysis of a complex of statistical variables into principal components.

  1933cited by this paper
• Journal of Graph Algorithms and Applications a Fast Multi-scale Method for Drawing Large Graphs

  year unknowncited by this paper

• Defining Data Science by a Data-Driven Quantification of the Community

  2018influential citation