Sciweavers

243 search results - page 10 / 49
» Listing All Plane Graphs
Sort
View
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
13 years 7 months ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
János Barát, Jirí Matousek, D...
COMGEO
2007
ACM
13 years 7 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
CP
2006
Springer
13 years 9 months ago
Graph Properties Based Filtering
Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and ...
Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey...
DCG
2010
80views more  DCG 2010»
13 years 7 months ago
Geometry of Configuration Spaces of Tensegrities
Consider a graph G with n vertices. In this paper we study geometric conditions for an n-tuple of points in Rd to admit a non-zero self stress with underlying graph G. We introduce...
Franck Doray, Oleg Karpenkov, Jan Schepers
TALG
2008
115views more  TALG 2008»
13 years 7 months ago
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatki...