Sciweavers

1188 search results - page 45 / 238
» Extended Graph Unification
Sort
View
PUK
2000
13 years 11 months ago
OCL-Graph: Exploiting Object Structure in a Plan Graph Algorithm
In this paper we discuss and describe preliminary results of integrating two strands of planning research - that of using plan graphs to speed up planning, and that of using object...
Ron M. Simpson, T. L. McCluskey, Donghong Liu
CCCG
2009
13 years 11 months ago
On Graph Thickness, Geometric Thickness, and Separator Theorems
We investigate the relationship between geometric thickness and the thickness, outerthickness, and arboricity of graphs. In particular, we prove that all graphs with arboricity tw...
Christian A. Duncan
DAM
2007
105views more  DAM 2007»
13 years 10 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
4OR
2005
71views more  4OR 2005»
13 years 9 months ago
On rank-perfect subclasses of near-bipartite graphs
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
Annegret Wagler
COMBINATORICS
2004
130views more  COMBINATORICS 2004»
13 years 9 months ago
On-line Ramsey Theory
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Ki...