Sciweavers

9 search results - page 1 / 2
» Computing Large Matchings in Planar Graphs with Fixed Minimu...
Sort
View
ISAAC
2009
Springer
133views Algorithms» more  ISAAC 2009»
13 years 10 months ago
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
Robert Franke, Ignaz Rutter, Dorothea Wagner
GD
2006
Springer
13 years 7 months ago
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
David R. Wood, Jan Arne Telle
EJC
2010
13 years 3 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 3 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
ICALP
2009
Springer
14 years 3 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh