1857 search results - page 294 / 372 » Minimum Degree Orderings |
178
click to vote
AIEDU
2008
15 years 6 months ago
2008
Annotating learning material with metadata allows easy reusability by different learning/tutoring systems. Several metadata standards have been developed to represent learning obje...
152
click to vote
ANOR
2010
15 years 6 months ago
2010
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
151
click to vote
CGF
2010
15 years 6 months ago
2010
In this paper, we present a novel technique which simulates directional light scattering for more realistic interactive visualization of volume data. Our method extends the recent...
164
click to vote
DM
2008
15 years 6 months ago
2008
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...
166
click to vote
EJC
2008
15 years 6 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...