430 search results - page 43 / 86 » Drawing Graphs with GLEE |
100
click to vote
ICFCA
2004
Springer
15 years 5 months ago
2004
Springer
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...
121
click to vote
SIGMOD
2010
ACM
14 years 10 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
118
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
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 ...
108
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
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 ...
106
click to vote
COMBINATORICS
2006
14 years 12 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...