Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Graph Drawing

From MaRDI portal
Publication:5897652
Jump to:navigation, search

DOI10.1007/11618058zbMATH Open1171.68651OpenAlexW4251892597MaRDI QIDQ5897652FDOQ5897652

Michael Wybrow, Peter J. Stuckey, Kim Marriott

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11618058




Recommendations

  • Orthogonal connector routing
  • Fast edge-routing for large graphs
  • scientific article; zbMATH DE number 4051669
  • Routing in polygons without rectilinearly visible corners
  • A Provably Good Algorithm for the Two Module Routing Problem


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)



Cited In (2)

  • Dunnart: A Constraint-Based Network Diagram Authoring Tool
  • Topology Preserving Constrained Graph Layout





This page was built for publication: Graph Drawing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897652)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5897652&oldid=16694527"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 17:39. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki