A Short Note on the History of Graph Drawing
Abstract
No abstract available.
Recommendations
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
FST TCS '02: Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer ScienceA three-dimensional (straight-line grid) drawing of a graph represents the vertices by points in Z 3 and the edges by noncrossing line segments. This research is motivated by the following open problem due to Felsner, Liotta, and Wismath [Graph Drawing '...
Note: Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density
It is proved that for all positive integers d,k,s,t with t>=k+1 there is a positive integer M=M(d,k,s,t) such that every graph with edge density at least d+k and at least M vertices contains a k-connected subgraph on at least t vertices, or s pairwise ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 23 September 2001
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in