Crossing boundaries
Abstract
Recommendations
On k-planar crossing numbers
The k-planar crossing number of a graph is the minimum number of crossings of its edges over all possible drawings of the graph in k planes. We propose algorithms and methods for k-planar drawings of general graphs together with lower bound techniques. ...
Crossing boundaries: on the inevitable intertwining of digital, physical, and social spaces
SEsCPS '17: Proceedings of the 3rd International Workshop on Software Engineering for Smart Cyber-Physical Systems"Having Divided to Conquer We Must Reunite [to] Rule" [3]. Decomposition of problems and systems into smaller, more manageable units has been at the heart of software engineering practice for decades. "Separation of concerns" gives software engineers ...
Degenerate Crossing Numbers
Let G be a graph with n vertices and eź4n edges, drawn in the plane in such a way that if two or more edges (arcs) share an interior point p, then they properly cross one another at p. It is shown that the number of crossing points, counted without ...
Comments
Information & Contributors
Information
Published In
- Editors:
- Inbal Talgam-Cohen,
- Sean Follmer
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Editorial
- Popular
- Un-reviewed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 257Total Downloads
- Downloads (Last 12 months)48
- Downloads (Last 6 weeks)3
Other Metrics
Citations
View Options
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderDigital Edition
View this article in digital edition.
Digital EditionMagazine Site
View this article on the magazine site (external)
Magazine SiteLogin options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in