5889 search results - page 88 / 1178 » Graph Layout Problems |
CORR
2012
Springer
12 years 5 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
ESA
2008
Springer
13 years 11 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 ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Given a weighted graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a...
EJC
2010
13 years 10 months ago
2010
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...