Sciweavers

191 search results - page 17 / 39
» Intersections of graphs
Sort
View
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 7 months ago
Coloring translates and homothets of a convex body
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of fini...
Adrian Dumitrescu, Minghui Jiang
COCOON
2006
Springer
13 years 11 months ago
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
Min Chih Lin, Jayme Luiz Szwarcfiter
ICIP
2003
IEEE
14 years 9 months ago
Detection and extraction of road networks from high resolution satellite images
This article addresses the problem of road extraction from new high resolution satellite images. The proposed algorithm is divided in two sequential modules : a topologically corr...
Renaud Péteri, Julien Celle, Thierry Ranchi...
DIAGRAMS
2004
Springer
14 years 26 days ago
Ensuring the Drawability of Extended Euler Diagrams for up to 8 Sets
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
Anne Verroust, Marie-Luce Viaud