1188 search results - page 45 / 238 » Extended Graph Unification |
103
Voted
PUK
2000
15 years 2 months ago
2000
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...
92
Voted
CCCG
2009
15 years 1 months ago
2009
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...
109
Voted
DAM
2007
15 years 24 days ago
2007
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 ...
87
Voted
4OR
2005
15 years 23 days ago
2005
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...
94
Voted
COMBINATORICS
2004
15 years 21 days ago
2004
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...