5889 search results - page 473 / 1178 » Graph Layout Problems |
166
click to vote
GD
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. In this paper we consider the problem of simultaneous drawing of two graphs. The goal is to produce aesthetically pleasing drawings for the two graphs by means of a heuri...
200
click to vote
STACS
2010
Springer
16 years 23 days ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
225
click to vote
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
177
click to vote
ECAI
2008
Springer
15 years 9 months ago
2008
Springer
In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid...
221
click to vote
SODA
1998
ACM
15 years 9 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...