Sciweavers

3757 search results - page 8 / 752
» The overlap number of a graph
Sort
View
GRAPHITE
2003
ACM
14 years 18 days ago
Improved CSG rendering using overlap graph subtraction sequences
Nigel Stewart, Geoff Leach, Sabu John
AMCS
2008
113views Mathematics» more  AMCS 2008»
13 years 7 months ago
Inferring Graph Grammars by Detecting Overlap in Frequent Subgraphs
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
ICALP
2011
Springer
12 years 10 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
NETWORKS
2010
13 years 5 months ago
Mixed search number and linear-width of interval and split graphs
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
COMGEO
2011
ACM
13 years 2 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...