1105 search results - page 63 / 221 » Linear choosability of graphs |
JGAA
2008
14 years 12 months ago
2008
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
103
click to vote
CC
2006
Springer
15 years 3 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
PKDD
2000
Springer
15 years 3 months ago
2000
Springer
: Relational representation of objects using graphs reveals much information that cannot be obtained by attribute value representations alone. There are already many databases that...
WG
2007
Springer
15 years 6 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
DCOSS
2005
Springer
15 years 5 months ago
2005
Springer
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...