Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Graph graphics: Theory and practice

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

DOI10.1016/0898-1221(88)90208-8zbMath0645.68079OpenAlexW2085219981MaRDI QIDQ1103411

B. George

Publication date: 1988

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(88)90208-8


zbMATH Keywords

complexityVLSIgraph drawingpolynomial-time algorithmsgraph layoutexpository survey


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Planar graphs; geometric and topological aspects of graph theory (05C10)


Related Items

A framework and algorithms for circular drawings of graphs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • A framework for solving VLSI graph layout problems
  • A linear algorithm for embedding planar graphs using PQ-trees
  • Graph theoretic foundations of pathfinder networks
  • Computing an st-numbering
  • Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
  • Parallel concepts in graph theory
  • Crossing Number is NP-Complete
  • NP-completeness for minimizing maximum edge length in grid embeddings
  • Efficient Planarity Testing
  • How to Draw a Graph
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1103411&oldid=13140389"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki