Sciweavers

554 search results - page 64 / 111
» Power Domination Problem in Graphs
Sort
View
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
14 years 1 months ago
Partitioning graphs of supply and demand
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
ICDE
2001
IEEE
159views Database» more  ICDE 2001»
14 years 9 months ago
Workflow and Process Synchronization with Interaction Expressions and Graphs
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...
Christian Heinlein
ESWS
2010
Springer
14 years 16 days ago
Replication and Versioning of Partial RDF Graphs
The sizes of datasets available as RDF (e.g., as part of the Linked Data cloud) are increasing continuously. For instance, the recent DBpedia version consists of nearly 500 million...
Bernhard Schandl
PDPTA
2007
13 years 9 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker