Results 1  10
of
181,589
VERTEX DECOMPOSITIONS OF SPARSE GRAPHS INTO AN INDEPENDENT VERTEX SET AND A SUBGRAPH OF MAXIMUM DEGREE AT MOST 1
, 2011
"... A graph G is (1, 0)colorable if its vertex set can be partitioned into subsets V1 and V0 so that in G[V1] every vertex has degree at most 1, while G[V0] is edgeless. We prove that every graph with maximum average degree at most 12 5 is (1, 0)colorable. In particular, every planar graph with girth ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A graph G is (1, 0)colorable if its vertex set can be partitioned into subsets V1 and V0 so that in G[V1] every vertex has degree at most 1, while G[V0] is edgeless. We prove that every graph with maximum average degree at most 12 5 is (1, 0)colorable. In particular, every planar graph with girth
Vertex
"... Abstract. The structural semantics of UMLbased metamodeling were recently explored[1], providing a characterization of the models adhering to a metamodel. In particular, metamodels can be converted to a set of constraints expressed in a decidable subset of firstorder logic, an extended Horn logic. ..."
Abstract
 Add to MetaCart
Abstract. The structural semantics of UMLbased metamodeling were recently explored[1], providing a characterization of the models adhering to a metamodel. In particular, metamodels can be converted to a set of constraints expressed in a decidable subset of firstorder logic, an extended Horn logic. We augment the constructive techniques found in logic programming, which are also based on an extended Horn logic, to produce constructive techniques for reasoning about models and metamodels. These methods have a number of practical applications: At the metalevel, it can be decided if a (composite) metamodel characterizes a nonempty set of models, and a member can be automatically constructed. At the modellevel, it can be decided if a submodel has an embeddeding in a wellformed model, and the larger model can be constructed. This amounts to automatic model construction from an incomplete model. We describe the concrete algorithms for constructively solving these problems, and provide concrete examples. 1 Preliminaries Metamodels, Domains, and Logic This paper describes constructive techniques, similar to those found in logic programming, for reasoning about domainspecific modeling languages (DSMLs) defined with metamodels. Before we proceed, we must describe how a metamodel can be viewed as a formal object that characterizes the wellformed models adhering to that metamodel. We will refer to the models that adhere to metamodel X as the models of metamodel X. In order to build some intuition for
A userprogrammable vertex engine
 In Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques (ACM SIGGRAPH 2001
"... In this paper we describe the design, programming interface, and implementation of a very efficient userprogrammable vertex engine. The vertex engine of NVIDIA’s GeForce3 GPU evolved from a highly tuned fixedfunction pipeline requiring considerable knowledge to program. Programs operate only on a ..."
Abstract

Cited by 192 (1 self)
 Add to MetaCart
In this paper we describe the design, programming interface, and implementation of a very efficient userprogrammable vertex engine. The vertex engine of NVIDIA’s GeForce3 GPU evolved from a highly tuned fixedfunction pipeline requiring considerable knowledge to program. Programs operate only on a
Vertex Cover: Further Observations and Further Improvements
 Journal of Algorithms
, 1999
"... Recently, there have been increasing interests and progresses in lowering the worst case time complexity for wellknown NPhard problems, in particular for the Vertex Cover problem. In this paper, new properties for the Vertex Cover problem are indicated and several simple and new techniques are int ..."
Abstract

Cited by 186 (19 self)
 Add to MetaCart
Recently, there have been increasing interests and progresses in lowering the worst case time complexity for wellknown NPhard problems, in particular for the Vertex Cover problem. In this paper, new properties for the Vertex Cover problem are indicated and several simple and new techniques
Edgebreaker: Connectivity compression for triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits to store ..."
Abstract

Cited by 297 (24 self)
 Add to MetaCart
and decompression are independent of the vertex locations, they may be combined with a variety of vertexcompressing techniques that exploit topological information about the mesh to better estimate vertex locations. Edgebreaker may be used to compress the connectivity of an entire mesh bounding a 3D polyhedron
Annals of Vertex Covering and Independence in Semigraph
, 2013
"... Abstract. Vertex covering and independence have been wellstudied concepts in graph theory. These concepts have also been defined in semigraph. In this paper we consider a subsemigraph G v − of a semigraph G where v is vertex of G. We prove that for one such subsemigraph G v − the vertex covering ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Vertex covering and independence have been wellstudied concepts in graph theory. These concepts have also been defined in semigraph. In this paper we consider a subsemigraph G v − of a semigraph G where v is vertex of G. We prove that for one such subsemigraph G v − the vertex covering
Results 1  10
of
181,589