57 search results - page 11 / 12 » Inapproximability for planar embedding problems |
112
click to vote
ISBRA
2009
Springer
15 years 4 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
116
Voted
KIVS
2011
Springer
14 years 9 days ago
2011
Springer
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
SIAMDM
2010
14 years 4 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
GD
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...