Sciweavers

1633 search results - page 90 / 327
» Planar Map Graphs
Sort
View
WABI
2007
Springer
121views Bioinformatics» more  WABI 2007»
14 years 4 months ago
Seeded Tree Alignment and Planar Tanglegram Layout
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computat...
Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabr...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 10 months ago
Hitting forbidden minors: Approximation and Kernelization
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra...
GD
2004
Springer
14 years 3 months ago
Really Straight Graph Drawings
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...
Vida Dujmovic, Matthew Suderman, David R. Wood
EJC
2010
13 years 10 months ago
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
Julia Böttcher, Klaas P. Pruessmann, Anusch T...
COMGEO
2007
ACM
13 years 10 months ago
Graph drawings with few slopes
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
Vida Dujmovic, Matthew Suderman, David R. Wood