Sciweavers

1633 search results - page 77 / 327
» Planar Map Graphs
Sort
View
COCOON
2009
Springer
14 years 4 months ago
Edge-Intersection Graphs of k-Bend Paths in Grids
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid pa...
Therese C. Biedl, Michal Stern
GD
2005
Springer
14 years 3 months ago
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
CAIP
2009
Springer
210views Image Analysis» more  CAIP 2009»
14 years 2 months ago
Shape Classification Using a Flexible Graph Kernel
The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junctio...
François-Xavier Dupé, Luc Brun
JGAA
2007
104views more  JGAA 2007»
13 years 10 months ago
Bar k-Visibility Graphs
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
SIROCCO
2010
13 years 11 months ago
Average Long-Lived Memoryless Consensus: The Three-Value Case
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
Ivan Rapaport, Eric Rémila