Sciweavers

712 search results - page 59 / 143
» On Spectral Graph Drawing
Sort
View
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 9 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
ICFCA
2004
Springer
14 years 2 months ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese
COMPGEOM
2010
ACM
14 years 1 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
13 years 10 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 7 months ago
Evolving Graph Representation and Visualization
The study of evolution of networks has received increased interest with the recent discovery that many real-world networks possess many things in common, in particular the manner ...
Anurat Chapanond, Mukkai S. Krishnamoorthy, G. M. ...