1027 search results - page 22 / 206 » Ordered Vertex Partitioning |
CGF
2000
13 years 9 months ago
2000
Multiresolution shape representation is a very effective way to decompose surface geometry into several levels of detail. Geometric modeling with such representations enables flex...
DM
2006
13 years 9 months ago
2006
Let n be a positive integer. A tournament is called n-existentially closed (or n-e.c.) if for every subset S of n vertices and for every subset T of S, there is a vertex x / S whi...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
SMI
2003
IEEE
14 years 2 months ago
2003
IEEE
A lot of techniques have been developed for the encoding of triangular meshes as this is a widely used representation for the description of surface models. Although methods for t...