Positioning a New Vertex that Minimize the Number of New Crossings

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Journal of Applied Sciences

• Publication date

  2011-12-01

• Fields of study

  Mathematics

• Identifiers
  DOI 10.3923/JAS.2011.2260.2264
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Crossing minimization in extended level drawings of graphs

  2010cited by this paper
• Graph Drawing Algorithms: Using in Software Tools

  2010cited by this paper
• Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings

  2010cited by this paper
• On the complexity of crossings in permutations

  2009cited by this paper
• A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information

  2007cited by this paper
• Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas

  2002cited by this paper
• One Sided Crossing Minimization Is NP-Hard for Sparse Graphs

  2001cited by this paper

• Improving readability of static, straight-line graph drawings: A first look at edge crossing resolution through iterative vertex splitting

  2023cites this paper