3204 search results - page 101 / 641 » The Alcuin Number of a Graph |
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
SMI
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we describe a novel method for searching and comparing 3D objects. The method encodes the geometric and topological information in the form of a skeletal graph and ...
SIAMDM
2000
13 years 8 months ago
2000
We show that the size of the smallest depth-two N-superconcentrator is (N log2 N/ log log N). Before this work, optimal bounds were known for all depths except two. For the upper b...
JAL
2002
13 years 7 months ago
2002
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
JGAA
1998
13 years 7 months ago
1998
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...