Sciweavers

328 search results - page 28 / 66
» Homomorphism bounded classes of graphs
Sort
View
EJC
2010
13 years 8 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...
DNA
2011
Springer
213views Bioinformatics» more  DNA 2011»
12 years 8 months ago
Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes
Sticker complexes are a a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a pure...
Robert Brijder, Joris J. M. Gillis, Jan Van den Bu...
STACS
2007
Springer
14 years 2 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald
WADS
2007
Springer
106views Algorithms» more  WADS 2007»
14 years 2 months ago
Maximizing Maximal Angles for Plane Straight-Line Graphs
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...
TAMC
2010
Springer
13 years 6 months ago
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
Pinar Heggernes, Daniel Meister, Udi Rotics