721 search results - page 29 / 145 » Graphs with Large Obstacle Numbers |
IJBC
2007
15 years 3 months ago
2007
In this paper we present a model of impact dynamics in large dimensional systems. We describe a hybrid method, based on graph theory and probability theory, which enables us quali...
118
click to vote
EJC
2010
15 years 3 months ago
2010
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
126
click to vote
IPL
2000
15 years 2 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
124
click to vote
DAGSTUHL
2000
15 years 4 months ago
2000
Algorithmic experiments yield large amounts of data that depends on many parameters. This paper collects a number of rules for presenting this data in concise, meaningful, understa...
137
click to vote
PR
2008
15 years 3 months ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...