Sciweavers

721 search results - page 29 / 145
» Graphs with Large Obstacle Numbers
Sort
View
IJBC
2007
54views more  IJBC 2007»
13 years 9 months ago
Impact Dynamics of Large Dimensional Systems
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...
Martin E. Homer, S. John Hogan
EJC
2010
13 years 9 months ago
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
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...
Julia Böttcher, Klaas P. Pruessmann, Anusch T...
IPL
2000
111views more  IPL 2000»
13 years 9 months ago
On the performance of the first-fit coloring algorithm on permutation graphs
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...
Stavros D. Nikolopoulos, Charis Papadopoulos
DAGSTUHL
2000
13 years 11 months ago
Presenting Data from Experiments in Algorithmics
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...
Peter Sanders
PR
2008
206views more  PR 2008»
13 years 9 months ago
A study of graph spectra for comparing graphs and trees
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...
Richard C. Wilson, Ping Zhu